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

Percentage Accurate: 74.6% → 90.1%

Time: 4.8s

Alternatives: 12

Speedup: 0.4×

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.6% 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: 90.1% 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}}\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{\mathsf{fma}\left(b, y, t \cdot \left(1 + a\right)\right)}, \frac{x}{a}\right)\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-321}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_1 \leq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{\frac{x}{b}}{y}, t, \frac{z}{b}\right)\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+302}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{z + \frac{t \cdot x}{y}}{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))
     (fma y (/ z (fma b y (* t (+ 1.0 a)))) (/ x a))
     (if (<= t_1 -1e-321)
       t_1
       (if (<= t_1 0.0)
         (fma (/ (/ x b) y) t (/ z b))
         (if (<= t_1 2e+302) t_1 (/ (+ z (/ (* t x) y)) 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 = fma(y, (z / fma(b, y, (t * (1.0 + a)))), (x / a));
	} else if (t_1 <= -1e-321) {
		tmp = t_1;
	} else if (t_1 <= 0.0) {
		tmp = fma(((x / b) / y), t, (z / b));
	} else if (t_1 <= 2e+302) {
		tmp = t_1;
	} else {
		tmp = (z + ((t * x) / y)) / 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 = fma(y, Float64(z / fma(b, y, Float64(t * Float64(1.0 + a)))), Float64(x / a));
	elseif (t_1 <= -1e-321)
		tmp = t_1;
	elseif (t_1 <= 0.0)
		tmp = fma(Float64(Float64(x / b) / y), t, Float64(z / b));
	elseif (t_1 <= 2e+302)
		tmp = t_1;
	else
		tmp = Float64(Float64(z + Float64(Float64(t * x) / y)) / 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[(y * N[(z / N[(b * y + N[(t * N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -1e-321], t$95$1, If[LessEqual[t$95$1, 0.0], N[(N[(N[(x / b), $MachinePrecision] / y), $MachinePrecision] * t + N[(z / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+302], t$95$1, N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / 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

   1. Initial program 34.2%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. 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)}} \]

   3. Applied rewrites 66.5%

      \[\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)} \]

   4. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 90.2

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

   6. Applied rewrites 90.2%

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

   7. Taylor expanded in a around inf

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

   9. Applied rewrites 74.3%

      \[\leadsto \mathsf{fma}\left(y, \frac{z}{\mathsf{fma}\left(b, y, t \cdot \left(1 + a\right)\right)}, \frac{x}{\color{blue}{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))) < -9.98013e-322 or -0.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 2.0000000000000002e302

   1. Initial program 99.2%

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

   if -9.98013e-322 < (/.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 53.9%

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

   2. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in x around inf

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

      1. lift-/.f64 71.6

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

   7. Applied rewrites 71.6%

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

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

   1. Initial program 12.9%

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

   2. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 52.3%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{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 78.3

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

   7. Applied rewrites 78.3%

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

Alternative 2: 75.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}{1 + a}\\ t_3 := \frac{t\_1}{\left(a + 1\right) + \frac{y \cdot b}{t}}\\ \mathbf{if}\;t\_3 \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{\mathsf{fma}\left(b, y, t \cdot \left(1 + a\right)\right)}, \frac{x}{a}\right)\\ \mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-321}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{-307}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\frac{x}{b}}{y}, t, \frac{z}{b}\right)\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+302}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{z + \frac{t \cdot x}{y}}{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 (+ 1.0 a)))
        (t_3 (/ t_1 (+ (+ a 1.0) (/ (* y b) t)))))
   (if (<= t_3 (- INFINITY))
     (fma y (/ z (fma b y (* t (+ 1.0 a)))) (/ x a))
     (if (<= t_3 -1e-321)
       t_2
       (if (<= t_3 2e-307)
         (fma (/ (/ x b) y) t (/ z b))
         (if (<= t_3 2e+302) t_2 (/ (+ z (/ (* t x) y)) 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 / (1.0 + a);
	double t_3 = t_1 / ((a + 1.0) + ((y * b) / t));
	double tmp;
	if (t_3 <= -((double) INFINITY)) {
		tmp = fma(y, (z / fma(b, y, (t * (1.0 + a)))), (x / a));
	} else if (t_3 <= -1e-321) {
		tmp = t_2;
	} else if (t_3 <= 2e-307) {
		tmp = fma(((x / b) / y), t, (z / b));
	} else if (t_3 <= 2e+302) {
		tmp = t_2;
	} else {
		tmp = (z + ((t * x) / y)) / 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(1.0 + a))
	t_3 = Float64(t_1 / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	tmp = 0.0
	if (t_3 <= Float64(-Inf))
		tmp = fma(y, Float64(z / fma(b, y, Float64(t * Float64(1.0 + a)))), Float64(x / a));
	elseif (t_3 <= -1e-321)
		tmp = t_2;
	elseif (t_3 <= 2e-307)
		tmp = fma(Float64(Float64(x / b) / y), t, Float64(z / b));
	elseif (t_3 <= 2e+302)
		tmp = t_2;
	else
		tmp = Float64(Float64(z + Float64(Float64(t * x) / y)) / 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[(1.0 + a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(y * N[(z / N[(b * y + N[(t * N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1e-321], t$95$2, If[LessEqual[t$95$3, 2e-307], N[(N[(N[(x / b), $MachinePrecision] / y), $MachinePrecision] * t + N[(z / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+302], t$95$2, N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / 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

   1. Initial program 34.2%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. 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)}} \]

   3. Applied rewrites 66.5%

      \[\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)} \]

   4. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 90.2

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

   6. Applied rewrites 90.2%

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

   7. Taylor expanded in a around inf

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

   9. Applied rewrites 74.3%

      \[\leadsto \mathsf{fma}\left(y, \frac{z}{\mathsf{fma}\left(b, y, t \cdot \left(1 + a\right)\right)}, \frac{x}{\color{blue}{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))) < -9.98013e-322 or 1.99999999999999982e-307 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 2.0000000000000002e302

   1. Initial program 99.2%

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

   2. Taylor expanded in y around 0

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

      1. lower-+.f64 76.5

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

   4. Applied rewrites 76.5%

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

   if -9.98013e-322 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.99999999999999982e-307

   1. Initial program 54.9%

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

   2. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 68.3%

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

   5. Taylor expanded in x around inf

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

      1. lift-/.f64 70.3

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

   7. Applied rewrites 70.3%

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

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

   1. Initial program 12.9%

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

   2. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 52.3%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{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 78.3

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

   7. Applied rewrites 78.3%

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

Alternative 3: 74.0% accurate, 0.3× 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}}\\ \mathbf{if}\;t\_2 \leq -1 \cdot 10^{-321}:\\ \;\;\;\;\frac{x}{1 + a} + \frac{y}{t} \cdot \frac{z}{1 + a}\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{-307}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\frac{x}{b}}{y}, t, \frac{z}{b}\right)\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+302}:\\ \;\;\;\;\frac{t\_1}{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
 (let* ((t_1 (+ x (/ (* y z) t))) (t_2 (/ t_1 (+ (+ a 1.0) (/ (* y b) t)))))
   (if (<= t_2 -1e-321)
     (+ (/ x (+ 1.0 a)) (* (/ y t) (/ z (+ 1.0 a))))
     (if (<= t_2 2e-307)
       (fma (/ (/ x b) y) t (/ z b))
       (if (<= t_2 2e+302) (/ t_1 (+ 1.0 a)) (/ (+ z (/ (* t x) y)) 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 tmp;
	if (t_2 <= -1e-321) {
		tmp = (x / (1.0 + a)) + ((y / t) * (z / (1.0 + a)));
	} else if (t_2 <= 2e-307) {
		tmp = fma(((x / b) / y), t, (z / b));
	} else if (t_2 <= 2e+302) {
		tmp = t_1 / (1.0 + a);
	} else {
		tmp = (z + ((t * x) / y)) / 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)))
	tmp = 0.0
	if (t_2 <= -1e-321)
		tmp = Float64(Float64(x / Float64(1.0 + a)) + Float64(Float64(y / t) * Float64(z / Float64(1.0 + a))));
	elseif (t_2 <= 2e-307)
		tmp = fma(Float64(Float64(x / b) / y), t, Float64(z / b));
	elseif (t_2 <= 2e+302)
		tmp = Float64(t_1 / 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_] := 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]}, If[LessEqual[t$95$2, -1e-321], N[(N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision] + N[(N[(y / t), $MachinePrecision] * N[(z / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e-307], N[(N[(N[(x / b), $MachinePrecision] / y), $MachinePrecision] * t + N[(z / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+302], N[(t$95$1 / N[(1.0 + a), $MachinePrecision]), $MachinePrecision], N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / 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))) < -9.98013e-322

   1. Initial program 89.3%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. 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)}} \]

   3. Applied rewrites 91.2%

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

   4. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\frac{x}{1 + a} + \frac{y \cdot z}{t \cdot \left(1 + a\right)}} \]
   5. 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 70.9

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

   6. Applied rewrites 70.9%

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

   if -9.98013e-322 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.99999999999999982e-307

   1. Initial program 54.9%

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

   2. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 68.3%

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

   5. Taylor expanded in x around inf

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

      1. lift-/.f64 70.3

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

   7. Applied rewrites 70.3%

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

   if 1.99999999999999982e-307 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 2.0000000000000002e302

   1. Initial program 99.3%

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

   2. Taylor expanded in y around 0

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

      1. lower-+.f64 77.6

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

   4. Applied rewrites 77.6%

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

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

   1. Initial program 12.9%

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

   2. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 52.3%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{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 78.3

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

   7. Applied rewrites 78.3%

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

Alternative 4: 89.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{\mathsf{fma}\left(b, y, t \cdot \left(1 + a\right)\right)}, \frac{x}{\mathsf{fma}\left(b, \frac{y}{t}, 1 + a\right)}\right)\\ \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 (<= (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))) INFINITY)
   (fma y (/ z (fma b y (* t (+ 1.0 a)))) (/ x (fma b (/ y t) (+ 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 (((x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t))) <= ((double) INFINITY)) {
		tmp = fma(y, (z / fma(b, y, (t * (1.0 + a)))), (x / fma(b, (y / t), (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 (Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t))) <= Inf)
		tmp = fma(y, Float64(z / fma(b, y, Float64(t * Float64(1.0 + a)))), Float64(x / fma(b, Float64(y / t), 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[LessEqual[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], Infinity], N[(y * N[(z / N[(b * y + N[(t * N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x / N[(b * N[(y / t), $MachinePrecision] + N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]]

Derivation

1. Split input into 2 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 82.9%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
   2. 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)}} \]

   3. Applied rewrites 83.2%

      \[\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)} \]

   4. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 88.7

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

   6. Applied rewrites 88.7%

      \[\leadsto \mathsf{fma}\left(y, \frac{z}{\color{blue}{\mathsf{fma}\left(b, y, t \cdot \left(1 + a\right)\right)}}, \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. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 68.1%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{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 92.6

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

   7. Applied rewrites 92.6%

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

Alternative 5: 67.8% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (+ z (/ (* t x) y)) b)))
   (if (<= y -6e+49)
     t_1
     (if (<= y 0.0215) (/ (+ x (/ (* y z) t)) (+ 1.0 a)) t_1))))

C

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

Python

def code(x, y, z, t, a, b):
	t_1 = (z + ((t * x) / y)) / b
	tmp = 0
	if y <= -6e+49:
		tmp = t_1
	elif y <= 0.0215:
		tmp = (x + ((y * z) / t)) / (1.0 + a)
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -6.0000000000000005e49 or 0.021499999999999998 < y

   1. Initial program 53.9%

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

   2. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 46.5%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{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 59.1

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

   7. Applied rewrites 59.1%

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

   if -6.0000000000000005e49 < y < 0.021499999999999998

   1. Initial program 92.4%

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

   2. Taylor expanded in y around 0

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

      1. lower-+.f64 75.3

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

   4. Applied rewrites 75.3%

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

Alternative 6: 68.0% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (fma y (/ z t) x) (+ 1.0 a))))
   (if (<= t -4.8e+38)
     t_1
     (if (<= t 1.75e-118) (/ (+ z (/ (* t x) y)) b) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.80000000000000035e38 or 1.75e-118 < t

   1. Initial program 81.1%

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

   2. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\frac{x + \frac{y \cdot z}{t}}{1 + a}} \]
   3. 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 72.4

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

   4. Applied rewrites 72.4%

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

   if -4.80000000000000035e38 < t < 1.75e-118

   1. Initial program 65.9%

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

   2. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 45.3%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{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 62.1

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

   7. Applied rewrites 62.1%

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

Alternative 7: 65.9% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ x (fma b (/ y t) (+ 1.0 a)))))
   (if (<= t -2.6e-20) t_1 (if (<= t 1.2e-38) (/ (+ z (/ (* t x) y)) b) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2.59999999999999995e-20 or 1.20000000000000011e-38 < t

   1. Initial program 81.7%

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

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{x}{1 + \left(a + \frac{b \cdot y}{t}\right)}} \]
   3. 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 68.2

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

   4. Applied rewrites 68.2%

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

   if -2.59999999999999995e-20 < t < 1.20000000000000011e-38

   1. Initial program 66.0%

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

   2. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 46.5%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{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 63.2

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

   7. Applied rewrites 63.2%

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

Alternative 8: 59.9% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ x (+ 1.0 a))))
   (if (<= t -4.6e+53)
     t_1
     (if (<= t 1.36e-27) (/ (+ z (/ (* t x) y)) b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (1.0 + a);
	double tmp;
	if (t <= -4.6e+53) {
		tmp = t_1;
	} else if (t <= 1.36e-27) {
		tmp = (z + ((t * x) / y)) / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x / (1.0d0 + a)
    if (t <= (-4.6d+53)) then
        tmp = t_1
    else if (t <= 1.36d-27) then
        tmp = (z + ((t * x) / y)) / b
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (1.0 + a);
	double tmp;
	if (t <= -4.6e+53) {
		tmp = t_1;
	} else if (t <= 1.36e-27) {
		tmp = (z + ((t * x) / y)) / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = x / (1.0 + a)
	tmp = 0
	if t <= -4.6e+53:
		tmp = t_1
	elif t <= 1.36e-27:
		tmp = (z + ((t * x) / y)) / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x / Float64(1.0 + a))
	tmp = 0.0
	if (t <= -4.6e+53)
		tmp = t_1;
	elseif (t <= 1.36e-27)
		tmp = Float64(Float64(z + Float64(Float64(t * x) / y)) / b);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = x / (1.0 + a);
	tmp = 0.0;
	if (t <= -4.6e+53)
		tmp = t_1;
	elseif (t <= 1.36e-27)
		tmp = (z + ((t * x) / y)) / b;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.60000000000000039e53 or 1.36e-27 < t

   1. Initial program 81.6%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 59.9

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

   4. Applied rewrites 59.9%

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

   if -4.60000000000000039e53 < t < 1.36e-27

   1. Initial program 68.1%

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

   2. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   4. Applied rewrites 44.5%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{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 59.8

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

   7. Applied rewrites 59.8%

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

Alternative 9: 40.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a + 1 \leq -500000:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{elif}\;a + 1 \leq 2:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= (+ a 1.0) -500000.0) (/ x a) (if (<= (+ a 1.0) 2.0) x (/ x a))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((a + 1.0) <= -500000.0) {
		tmp = x / a;
	} else if ((a + 1.0) <= 2.0) {
		tmp = x;
	} else {
		tmp = x / a;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a, 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) <= (-500000.0d0)) then
        tmp = x / a
    else if ((a + 1.0d0) <= 2.0d0) then
        tmp = x
    else
        tmp = x / a
    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) <= -500000.0) {
		tmp = x / a;
	} else if ((a + 1.0) <= 2.0) {
		tmp = x;
	} else {
		tmp = x / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (a + 1.0) <= -500000.0:
		tmp = x / a
	elif (a + 1.0) <= 2.0:
		tmp = x
	else:
		tmp = x / a
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 a #s(literal 1 binary64)) < -5e5 or 2 < (+.f64 a #s(literal 1 binary64))

   1. Initial program 74.4%

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

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{x}{1 + \left(a + \frac{b \cdot y}{t}\right)}} \]
   3. 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 54.3

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

   4. Applied rewrites 54.3%

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

   5. Taylor expanded in a around inf

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

   7. Applied rewrites 47.1%

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

   if -5e5 < (+.f64 a #s(literal 1 binary64)) < 2

   1. Initial program 74.7%

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

   2. Taylor expanded in a around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 73.6

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

   4. Applied rewrites 73.6%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 34.7%

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

Alternative 10: 55.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{1 + a}\\ \mathbf{if}\;t \leq -1.18 \cdot 10^{+38}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 9.2 \cdot 10^{-29}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ x (+ 1.0 a))))
   (if (<= t -1.18e+38) t_1 (if (<= t 9.2e-29) (/ z b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (1.0 + a);
	double tmp;
	if (t <= -1.18e+38) {
		tmp = t_1;
	} else if (t <= 9.2e-29) {
		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 = x / (1.0d0 + a)
    if (t <= (-1.18d+38)) then
        tmp = t_1
    else if (t <= 9.2d-29) 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 = x / (1.0 + a);
	double tmp;
	if (t <= -1.18e+38) {
		tmp = t_1;
	} else if (t <= 9.2e-29) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = x / (1.0 + a)
	tmp = 0
	if t <= -1.18e+38:
		tmp = t_1
	elif t <= 9.2e-29:
		tmp = z / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x / Float64(1.0 + a))
	tmp = 0.0
	if (t <= -1.18e+38)
		tmp = t_1;
	elseif (t <= 9.2e-29)
		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 = x / (1.0 + a);
	tmp = 0.0;
	if (t <= -1.18e+38)
		tmp = t_1;
	elseif (t <= 9.2e-29)
		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[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -1.18e+38], t$95$1, If[LessEqual[t, 9.2e-29], N[(z / b), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -1.18e38 or 9.19999999999999965e-29 < t

   1. Initial program 81.6%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 59.5

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

   4. Applied rewrites 59.5%

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

   if -1.18e38 < t < 9.19999999999999965e-29

   1. Initial program 67.7%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 51.5

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

   4. Applied rewrites 51.5%

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

Alternative 11: 43.1% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.95 \cdot 10^{-121}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;y \leq 6.9 \cdot 10^{-10}:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -1.95e-121) (/ z b) (if (<= y 6.9e-10) (/ x a) (/ z b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -1.95e-121) {
		tmp = z / b;
	} else if (y <= 6.9e-10) {
		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 (y <= (-1.95d-121)) then
        tmp = z / b
    else if (y <= 6.9d-10) 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 (y <= -1.95e-121) {
		tmp = z / b;
	} else if (y <= 6.9e-10) {
		tmp = x / a;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -1.95e-121:
		tmp = z / b
	elif y <= 6.9e-10:
		tmp = x / a
	else:
		tmp = z / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -1.95e-121)
		tmp = Float64(z / b);
	elseif (y <= 6.9e-10)
		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 (y <= -1.95e-121)
		tmp = z / b;
	elseif (y <= 6.9e-10)
		tmp = x / a;
	else
		tmp = z / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -1.95e-121], N[(z / b), $MachinePrecision], If[LessEqual[y, 6.9e-10], N[(x / a), $MachinePrecision], N[(z / b), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.95e-121 or 6.89999999999999995e-10 < y

   1. Initial program 61.2%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 47.3

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

   4. Applied rewrites 47.3%

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

   if -1.95e-121 < y < 6.89999999999999995e-10

   1. Initial program 94.8%

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

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{x}{1 + \left(a + \frac{b \cdot y}{t}\right)}} \]
   3. 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.1

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

   4. Applied rewrites 73.1%

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

   5. Taylor expanded in a around inf

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

   7. Applied rewrites 36.6%

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

Alternative 12: 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 74.6%

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

2. Taylor expanded in a around 0

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

   1. lower-/.f64 N/A

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

   2. +-commutative N/A

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

   3. associate-/l* N/A

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

   4. lower-fma.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. +-commutative N/A

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

   7. associate-/l* N/A

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

   8. lower-fma.f64 N/A

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

   9. lower-/.f64 45.3

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

4. Applied rewrites 45.3%

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

5. Taylor expanded in y around 0

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

7. Applied rewrites 19.5%

   \[\leadsto x \]
8. Add Preprocessing

Developer Target 1: 79.3% 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 2025093 
(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))))