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

Percentage Accurate: 74.5% → 87.8%

Time: 5.5s

Alternatives: 17

Speedup: 0.5×

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.5% 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: 87.8% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 32.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 74.3%

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

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

   1. Initial program 89.9%

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

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

   1. Initial program 11.0%

      \[\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 81.7

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

   4. Applied rewrites 81.7%

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

Alternative 2: 87.3% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 32.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 64.8%

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

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

   1. Initial program 89.9%

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

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

   1. Initial program 11.0%

      \[\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 81.7

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

   4. Applied rewrites 81.7%

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

Alternative 3: 86.8% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Java

public static 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.POSITIVE_INFINITY) {
		tmp = z / b;
	} else if (t_1 <= 1e+308) {
		tmp = t_1;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t))
	tmp = 0
	if t_1 <= -math.inf:
		tmp = z / b
	elif t_1 <= 1e+308:
		tmp = t_1
	else:
		tmp = z / b
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t));
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = z / b;
	elseif (t_1 <= 1e+308)
		tmp = t_1;
	else
		tmp = z / b;
	end
	tmp_2 = 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[(z / b), $MachinePrecision], If[LessEqual[t$95$1, 1e+308], t$95$1, N[(z / 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 or 1e308 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 16.5%

      \[\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 74.8

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

   4. Applied rewrites 74.8%

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

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

   1. Initial program 89.9%

      \[\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 84.1% 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 10^{-81}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y, \frac{z}{t}, x\right)}{\mathsf{fma}\left(b, \frac{y}{t}, 1 + a\right)}\\ \mathbf{elif}\;t\_2 \leq 10^{+308}:\\ \;\;\;\;\frac{t\_1}{\mathsf{fma}\left(y, \frac{b}{t}, 1 + a\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(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-81], N[(N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision] / N[(b * N[(y / t), $MachinePrecision] + N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+308], N[(t$95$1 / N[(y * N[(b / t), $MachinePrecision] + N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z / b), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 81.8%

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 80.3

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

      8. lift-+.f64 N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. lift-/.f64 N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-/l* N/A

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

      16. lower-fma.f64 N/A

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

      17. lower-/.f64 N/A

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

      18. lower-+.f64 81.3

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

   3. Applied rewrites 81.3%

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

   if 9.9999999999999996e-82 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1e308

   1. Initial program 99.7%

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-+.f64 94.4

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

   3. Applied rewrites 94.4%

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

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

   1. Initial program 11.0%

      \[\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 81.7

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

   4. Applied rewrites 81.7%

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

Alternative 5: 67.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(z / b), $MachinePrecision], If[LessEqual[t$95$1, 1e+308], N[(x / N[(b * N[(y / t), $MachinePrecision] + N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z / 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 or 1e308 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 16.5%

      \[\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 74.8

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

   4. Applied rewrites 74.8%

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

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

   1. Initial program 89.9%

      \[\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 65.1

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

   4. Applied rewrites 65.1%

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

Alternative 6: 55.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

public static 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.POSITIVE_INFINITY) {
		tmp = z / b;
	} else if (t_1 <= 1e+308) {
		tmp = x / (1.0 + a);
	} else {
		tmp = z / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t))
	tmp = 0
	if t_1 <= -math.inf:
		tmp = z / b
	elif t_1 <= 1e+308:
		tmp = x / (1.0 + a)
	else:
		tmp = z / b
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t));
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = z / b;
	elseif (t_1 <= 1e+308)
		tmp = x / (1.0 + a);
	else
		tmp = z / b;
	end
	tmp_2 = 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[(z / b), $MachinePrecision], If[LessEqual[t$95$1, 1e+308], N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision], N[(z / 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 or 1e308 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 16.5%

      \[\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 74.8

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

   4. Applied rewrites 74.8%

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

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

   1. Initial program 89.9%

      \[\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 50.6

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

   4. Applied rewrites 50.6%

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

Alternative 7: 82.8% accurate, 0.5× 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 10^{+308}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y, \frac{z}{t}, x\right)}{\mathsf{fma}\left(b, \frac{y}{t}, 1 + a\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))) 1e+308)
   (/ (fma y (/ z t) x) (fma b (/ y t) (+ 1.0 a)))
   (/ z b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (((x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t))) <= 1e+308) {
		tmp = fma(y, (z / t), x) / fma(b, (y / t), (1.0 + a));
	} else {
		tmp = z / 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))) <= 1e+308)
		tmp = Float64(fma(y, Float64(z / t), x) / fma(b, Float64(y / t), Float64(1.0 + a)));
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := 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], 1e+308], N[(N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision] / N[(b * N[(y / t), $MachinePrecision] + N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z / 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))) < 1e308

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 83.0

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

      8. lift-+.f64 N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. lift-/.f64 N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-/l* N/A

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

      16. lower-fma.f64 N/A

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

      17. lower-/.f64 N/A

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

      18. lower-+.f64 83.0

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

   3. Applied rewrites 83.0%

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

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

   1. Initial program 11.0%

      \[\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 81.7

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

   4. Applied rewrites 81.7%

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

Alternative 8: 65.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (fma y (/ z t) x)))
   (if (<= a -1.42e-5)
     (/ t_1 (+ 1.0 a))
     (if (<= a 5.4e-213)
       (/ t_1 (fma b (/ y t) 1.0))
       (if (<= a 2.3e-45)
         (fma (/ x (* b y)) t (/ z b))
         (if (<= a 47000000000000.0)
           (/ x (fma b (/ y t) (+ 1.0 a)))
           (/ t_1 (fma b (/ y t) a))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(y, (z / t), x);
	double tmp;
	if (a <= -1.42e-5) {
		tmp = t_1 / (1.0 + a);
	} else if (a <= 5.4e-213) {
		tmp = t_1 / fma(b, (y / t), 1.0);
	} else if (a <= 2.3e-45) {
		tmp = fma((x / (b * y)), t, (z / b));
	} else if (a <= 47000000000000.0) {
		tmp = x / fma(b, (y / t), (1.0 + a));
	} else {
		tmp = t_1 / fma(b, (y / t), a);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = fma(y, Float64(z / t), x)
	tmp = 0.0
	if (a <= -1.42e-5)
		tmp = Float64(t_1 / Float64(1.0 + a));
	elseif (a <= 5.4e-213)
		tmp = Float64(t_1 / fma(b, Float64(y / t), 1.0));
	elseif (a <= 2.3e-45)
		tmp = fma(Float64(x / Float64(b * y)), t, Float64(z / b));
	elseif (a <= 47000000000000.0)
		tmp = Float64(x / fma(b, Float64(y / t), Float64(1.0 + a)));
	else
		tmp = Float64(t_1 / fma(b, Float64(y / t), a));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 5 regimes

2. if a < -1.42e-5

   1. Initial program 73.4%

      \[\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 61.7

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

   4. Applied rewrites 61.7%

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

   if -1.42e-5 < a < 5.4000000000000001e-213

   1. Initial program 75.1%

      \[\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 74.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 74.3%

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

   if 5.4000000000000001e-213 < a < 2.29999999999999992e-45

   1. Initial program 76.2%

      \[\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 42.2%

      \[\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{x}{b \cdot y}, t, \frac{z}{b}\right) \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-*.f64 47.4

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

   7. Applied rewrites 47.4%

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

   if 2.29999999999999992e-45 < a < 4.7e13

   1. Initial program 77.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 52.7

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

   4. Applied rewrites 52.7%

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

   if 4.7e13 < a

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 71.8

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

      8. lift-+.f64 N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. lift-/.f64 N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-/l* N/A

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

      16. lower-fma.f64 N/A

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

      17. lower-/.f64 N/A

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

      18. lower-+.f64 71.8

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

   3. Applied rewrites 71.8%

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

   4. Taylor expanded in a around inf

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

   6. Applied rewrites 71.8%

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

Alternative 9: 53.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\mathsf{fma}\left(y, \frac{z}{t}, x\right)}{a}\\ t_2 := \frac{x}{\mathsf{fma}\left(b, \frac{y}{t}, 1\right)}\\ \mathbf{if}\;a \leq -6.2 \cdot 10^{-9}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq -1.95 \cdot 10^{-128}:\\ \;\;\;\;x + \frac{y \cdot z}{t}\\ \mathbf{elif}\;a \leq 5.4 \cdot 10^{-213}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;a \leq 9.2 \cdot 10^{-80}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{elif}\;a \leq 280:\\ \;\;\;\;t\_2\\ \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) a)) (t_2 (/ x (fma b (/ y t) 1.0))))
   (if (<= a -6.2e-9)
     t_1
     (if (<= a -1.95e-128)
       (+ x (/ (* y z) t))
       (if (<= a 5.4e-213)
         t_2
         (if (<= a 9.2e-80) (/ z b) (if (<= a 280.0) t_2 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) / a;
	double t_2 = x / fma(b, (y / t), 1.0);
	double tmp;
	if (a <= -6.2e-9) {
		tmp = t_1;
	} else if (a <= -1.95e-128) {
		tmp = x + ((y * z) / t);
	} else if (a <= 5.4e-213) {
		tmp = t_2;
	} else if (a <= 9.2e-80) {
		tmp = z / b;
	} else if (a <= 280.0) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(fma(y, Float64(z / t), x) / a)
	t_2 = Float64(x / fma(b, Float64(y / t), 1.0))
	tmp = 0.0
	if (a <= -6.2e-9)
		tmp = t_1;
	elseif (a <= -1.95e-128)
		tmp = Float64(x + Float64(Float64(y * z) / t));
	elseif (a <= 5.4e-213)
		tmp = t_2;
	elseif (a <= 9.2e-80)
		tmp = Float64(z / b);
	elseif (a <= 280.0)
		tmp = t_2;
	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] / a), $MachinePrecision]}, Block[{t$95$2 = N[(x / N[(b * N[(y / t), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -6.2e-9], t$95$1, If[LessEqual[a, -1.95e-128], N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.4e-213], t$95$2, If[LessEqual[a, 9.2e-80], N[(z / b), $MachinePrecision], If[LessEqual[a, 280.0], t$95$2, t$95$1]]]]]]]

Derivation

1. Split input into 4 regimes

2. if a < -6.2000000000000001e-9 or 280 < a

   1. Initial program 73.6%

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

   2. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 60.9

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

   4. Applied rewrites 60.9%

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

   if -6.2000000000000001e-9 < a < -1.94999999999999998e-128

   1. Initial program 76.9%

      \[\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 47.4

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

   4. Applied rewrites 47.4%

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

   5. Taylor expanded in a around 0

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 46.9

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

   7. Applied rewrites 46.9%

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

   if -1.94999999999999998e-128 < a < 5.4000000000000001e-213 or 9.1999999999999993e-80 < a < 280

   1. Initial program 74.6%

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 73.5

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

      8. lift-+.f64 N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. lift-/.f64 N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-/l* N/A

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

      16. lower-fma.f64 N/A

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

      17. lower-/.f64 N/A

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

      18. lower-+.f64 74.6

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

   3. Applied rewrites 74.6%

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

   4. Taylor expanded in x around inf

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

   6. Applied rewrites 51.3%

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

   7. Taylor expanded in a around 0

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

   9. Applied rewrites 50.5%

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

   if 5.4000000000000001e-213 < a < 9.1999999999999993e-80

   1. Initial program 76.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 37.1

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

   4. Applied rewrites 37.1%

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

Alternative 10: 53.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (fma y (/ z t) x)) (t_2 (/ t_1 a)))
   (if (<= a -6.2e-9)
     t_2
     (if (<= a 1.85e-214)
       (/ t_1 1.0)
       (if (<= a 1.85e-99)
         (/ z b)
         (if (<= a 1.05) (+ x (/ (* y z) t)) t_2))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(y, (z / t), x);
	double t_2 = t_1 / a;
	double tmp;
	if (a <= -6.2e-9) {
		tmp = t_2;
	} else if (a <= 1.85e-214) {
		tmp = t_1 / 1.0;
	} else if (a <= 1.85e-99) {
		tmp = z / b;
	} else if (a <= 1.05) {
		tmp = x + ((y * z) / t);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = fma(y, Float64(z / t), x)
	t_2 = Float64(t_1 / a)
	tmp = 0.0
	if (a <= -6.2e-9)
		tmp = t_2;
	elseif (a <= 1.85e-214)
		tmp = Float64(t_1 / 1.0);
	elseif (a <= 1.85e-99)
		tmp = Float64(z / b);
	elseif (a <= 1.05)
		tmp = Float64(x + Float64(Float64(y * z) / t));
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if a < -6.2000000000000001e-9 or 1.05000000000000004 < a

   1. Initial program 73.7%

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

   2. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 60.7

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

   4. Applied rewrites 60.7%

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

   if -6.2000000000000001e-9 < a < 1.8500000000000001e-214

   1. Initial program 75.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 47.9

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

   4. Applied rewrites 47.9%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 47.7%

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

   if 1.8500000000000001e-214 < a < 1.85e-99

   1. Initial program 75.8%

      \[\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 36.8

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

   4. Applied rewrites 36.8%

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

   if 1.85e-99 < a < 1.05000000000000004

   1. Initial program 76.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 47.9

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

   4. Applied rewrites 47.9%

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

   5. Taylor expanded in a around 0

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 45.7

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

   7. Applied rewrites 45.7%

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

Alternative 11: 53.1% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ x (/ (* y z) t))) (t_2 (/ (fma y (/ z t) x) a)))
   (if (<= a -6.2e-9)
     t_2
     (if (<= a 1.85e-214)
       t_1
       (if (<= a 1.85e-99) (/ z b) (if (<= a 1.05) t_1 t_2))))))

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 = fma(y, (z / t), x) / a;
	double tmp;
	if (a <= -6.2e-9) {
		tmp = t_2;
	} else if (a <= 1.85e-214) {
		tmp = t_1;
	} else if (a <= 1.85e-99) {
		tmp = z / b;
	} else if (a <= 1.05) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x + Float64(Float64(y * z) / t))
	t_2 = Float64(fma(y, Float64(z / t), x) / a)
	tmp = 0.0
	if (a <= -6.2e-9)
		tmp = t_2;
	elseif (a <= 1.85e-214)
		tmp = t_1;
	elseif (a <= 1.85e-99)
		tmp = Float64(z / b);
	elseif (a <= 1.05)
		tmp = t_1;
	else
		tmp = t_2;
	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[(N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision] / a), $MachinePrecision]}, If[LessEqual[a, -6.2e-9], t$95$2, If[LessEqual[a, 1.85e-214], t$95$1, If[LessEqual[a, 1.85e-99], N[(z / b), $MachinePrecision], If[LessEqual[a, 1.05], t$95$1, t$95$2]]]]]]

Derivation

1. Split input into 3 regimes

2. if a < -6.2000000000000001e-9 or 1.05000000000000004 < a

   1. Initial program 73.7%

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

   2. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 60.7

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

   4. Applied rewrites 60.7%

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

   if -6.2000000000000001e-9 < a < 1.8500000000000001e-214 or 1.85e-99 < a < 1.05000000000000004

   1. Initial program 75.3%

      \[\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 47.9

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

   4. Applied rewrites 47.9%

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

   5. Taylor expanded in a around 0

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 47.5

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

   7. Applied rewrites 47.5%

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

   if 1.8500000000000001e-214 < a < 1.85e-99

   1. Initial program 75.8%

      \[\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 36.8

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

   4. Applied rewrites 36.8%

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

Alternative 12: 59.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{1 + a}\\ \mathbf{if}\;t \leq -6.4 \cdot 10^{-20}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq -3.1 \cdot 10^{-70}:\\ \;\;\;\;\frac{y}{t} \cdot \frac{z}{1 + a}\\ \mathbf{elif}\;t \leq 1.15 \cdot 10^{-68}:\\ \;\;\;\;\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 -6.4e-20)
     t_1
     (if (<= t -3.1e-70)
       (* (/ y t) (/ z (+ 1.0 a)))
       (if (<= t 1.15e-68) (/ (+ 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 <= -6.4e-20) {
		tmp = t_1;
	} else if (t <= -3.1e-70) {
		tmp = (y / t) * (z / (1.0 + a));
	} else if (t <= 1.15e-68) {
		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 <= (-6.4d-20)) then
        tmp = t_1
    else if (t <= (-3.1d-70)) then
        tmp = (y / t) * (z / (1.0d0 + a))
    else if (t <= 1.15d-68) 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 <= -6.4e-20) {
		tmp = t_1;
	} else if (t <= -3.1e-70) {
		tmp = (y / t) * (z / (1.0 + a));
	} else if (t <= 1.15e-68) {
		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 <= -6.4e-20:
		tmp = t_1
	elif t <= -3.1e-70:
		tmp = (y / t) * (z / (1.0 + a))
	elif t <= 1.15e-68:
		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 <= -6.4e-20)
		tmp = t_1;
	elseif (t <= -3.1e-70)
		tmp = Float64(Float64(y / t) * Float64(z / Float64(1.0 + a)));
	elseif (t <= 1.15e-68)
		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 <= -6.4e-20)
		tmp = t_1;
	elseif (t <= -3.1e-70)
		tmp = (y / t) * (z / (1.0 + a));
	elseif (t <= 1.15e-68)
		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, -6.4e-20], t$95$1, If[LessEqual[t, -3.1e-70], N[(N[(y / t), $MachinePrecision] * N[(z / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.15e-68], N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if t < -6.39999999999999941e-20 or 1.14999999999999998e-68 < t

   1. Initial program 82.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 56.9

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

   4. Applied rewrites 56.9%

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

   if -6.39999999999999941e-20 < t < -3.1e-70

   1. Initial program 82.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 54.8

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

   4. Applied rewrites 54.8%

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

   5. Taylor expanded in x around 0

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift-+.f64 31.3

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

   7. Applied rewrites 31.3%

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

   if -3.1e-70 < t < 1.14999999999999998e-68

   1. Initial program 62.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 49.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 66.7

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

   7. Applied rewrites 66.7%

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

Alternative 13: 59.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{1 + a}\\ \mathbf{if}\;t \leq -6.4 \cdot 10^{-20}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq -3.5 \cdot 10^{-70}:\\ \;\;\;\;\frac{y \cdot z}{t \cdot \left(1 + a\right)}\\ \mathbf{elif}\;t \leq 1.15 \cdot 10^{-68}:\\ \;\;\;\;\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 -6.4e-20)
     t_1
     (if (<= t -3.5e-70)
       (/ (* y z) (* t (+ 1.0 a)))
       (if (<= t 1.15e-68) (/ (+ 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 <= -6.4e-20) {
		tmp = t_1;
	} else if (t <= -3.5e-70) {
		tmp = (y * z) / (t * (1.0 + a));
	} else if (t <= 1.15e-68) {
		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 <= (-6.4d-20)) then
        tmp = t_1
    else if (t <= (-3.5d-70)) then
        tmp = (y * z) / (t * (1.0d0 + a))
    else if (t <= 1.15d-68) 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 <= -6.4e-20) {
		tmp = t_1;
	} else if (t <= -3.5e-70) {
		tmp = (y * z) / (t * (1.0 + a));
	} else if (t <= 1.15e-68) {
		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 <= -6.4e-20:
		tmp = t_1
	elif t <= -3.5e-70:
		tmp = (y * z) / (t * (1.0 + a))
	elif t <= 1.15e-68:
		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 <= -6.4e-20)
		tmp = t_1;
	elseif (t <= -3.5e-70)
		tmp = Float64(Float64(y * z) / Float64(t * Float64(1.0 + a)));
	elseif (t <= 1.15e-68)
		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 <= -6.4e-20)
		tmp = t_1;
	elseif (t <= -3.5e-70)
		tmp = (y * z) / (t * (1.0 + a));
	elseif (t <= 1.15e-68)
		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, -6.4e-20], t$95$1, If[LessEqual[t, -3.5e-70], N[(N[(y * z), $MachinePrecision] / N[(t * N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.15e-68], N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if t < -6.39999999999999941e-20 or 1.14999999999999998e-68 < t

   1. Initial program 82.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 56.9

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

   4. Applied rewrites 56.9%

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

   if -6.39999999999999941e-20 < t < -3.49999999999999974e-70

   1. Initial program 82.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 54.8

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

   4. Applied rewrites 54.8%

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

   5. Taylor expanded in x around 0

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift-+.f64 31.3

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

   7. Applied rewrites 31.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. frac-times N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-+.f64 30.2

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

   9. Applied rewrites 30.2%

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

   if -3.49999999999999974e-70 < t < 1.14999999999999998e-68

   1. Initial program 62.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 49.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 66.7

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

   7. Applied rewrites 66.7%

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

Alternative 14: 69.7% 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.9 \cdot 10^{-101}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 1.2 \cdot 10^{-85}:\\ \;\;\;\;\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.9e-101)
     t_1
     (if (<= t 1.2e-85) (/ (+ 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.9e-101) {
		tmp = t_1;
	} else if (t <= 1.2e-85) {
		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.9e-101)
		tmp = t_1;
	elseif (t <= 1.2e-85)
		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.9e-101], t$95$1, If[LessEqual[t, 1.2e-85], 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.9e-101 or 1.2e-85 < t

   1. Initial program 82.2%

      \[\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 70.7

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

   4. Applied rewrites 70.7%

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

   if -4.9e-101 < t < 1.2e-85

   1. Initial program 60.8%

      \[\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 49.9%

      \[\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 68.0

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

   7. Applied rewrites 68.0%

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

Alternative 15: 40.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -7.5 \cdot 10^{-13}:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{elif}\;a \leq 1.85 \cdot 10^{-214}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 2.7 \cdot 10^{-21}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= a -7.5e-13)
   (/ x a)
   (if (<= a 1.85e-214) x (if (<= a 2.7e-21) (/ z b) (/ x a)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -7.5e-13) {
		tmp = x / a;
	} else if (a <= 1.85e-214) {
		tmp = x;
	} else if (a <= 2.7e-21) {
		tmp = z / b;
	} 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 <= (-7.5d-13)) then
        tmp = x / a
    else if (a <= 1.85d-214) then
        tmp = x
    else if (a <= 2.7d-21) then
        tmp = z / b
    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 <= -7.5e-13) {
		tmp = x / a;
	} else if (a <= 1.85e-214) {
		tmp = x;
	} else if (a <= 2.7e-21) {
		tmp = z / b;
	} else {
		tmp = x / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if a <= -7.5e-13:
		tmp = x / a
	elif a <= 1.85e-214:
		tmp = x
	elif a <= 2.7e-21:
		tmp = z / b
	else:
		tmp = x / a
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (a <= -7.5e-13)
		tmp = Float64(x / a);
	elseif (a <= 1.85e-214)
		tmp = x;
	elseif (a <= 2.7e-21)
		tmp = Float64(z / b);
	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 <= -7.5e-13)
		tmp = x / a;
	elseif (a <= 1.85e-214)
		tmp = x;
	elseif (a <= 2.7e-21)
		tmp = z / b;
	else
		tmp = x / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[a, -7.5e-13], N[(x / a), $MachinePrecision], If[LessEqual[a, 1.85e-214], x, If[LessEqual[a, 2.7e-21], N[(z / b), $MachinePrecision], N[(x / a), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if a < -7.5000000000000004e-13 or 2.7000000000000001e-21 < a

   1. Initial program 73.8%

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 72.3

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

      8. lift-+.f64 N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. lift-/.f64 N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-/l* N/A

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

      16. lower-fma.f64 N/A

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

      17. lower-/.f64 N/A

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

      18. lower-+.f64 73.0

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

   3. Applied rewrites 73.0%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lift-+.f64 46.6

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

   6. Applied rewrites 46.6%

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

   7. Taylor expanded in a around inf

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

      1. lower-/.f64 44.3

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

   9. Applied rewrites 44.3%

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

   if -7.5000000000000004e-13 < a < 1.8500000000000001e-214

   1. Initial program 75.1%

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 74.1

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

      8. lift-+.f64 N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. lift-/.f64 N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-/l* N/A

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

      16. lower-fma.f64 N/A

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

      17. lower-/.f64 N/A

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

      18. lower-+.f64 74.7

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

   3. Applied rewrites 74.7%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lift-+.f64 35.0

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

   6. Applied rewrites 35.0%

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

   7. Taylor expanded in a around 0

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

   9. Applied rewrites 35.0%

      \[\leadsto x \]

   if 1.8500000000000001e-214 < a < 2.7000000000000001e-21

   1. Initial program 75.8%

      \[\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 38.0

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

   4. Applied rewrites 38.0%

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

Alternative 16: 41.0% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.2 \cdot 10^{+109}:\\ \;\;\;\;x\\ \mathbf{elif}\;t \leq 1.75 \cdot 10^{+79}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= t -1.2e+109) x (if (<= t 1.75e+79) (/ z b) x)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (t <= -1.2e+109) {
		tmp = x;
	} else if (t <= 1.75e+79) {
		tmp = z / b;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (t <= (-1.2d+109)) then
        tmp = x
    else if (t <= 1.75d+79) then
        tmp = z / b
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (t <= -1.2e+109) {
		tmp = x;
	} else if (t <= 1.75e+79) {
		tmp = z / b;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if t <= -1.2e+109:
		tmp = x
	elif t <= 1.75e+79:
		tmp = z / b
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (t <= -1.2e+109)
		tmp = x;
	elseif (t <= 1.75e+79)
		tmp = Float64(z / b);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (t <= -1.2e+109)
		tmp = x;
	elseif (t <= 1.75e+79)
		tmp = z / b;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[t, -1.2e+109], x, If[LessEqual[t, 1.75e+79], N[(z / b), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if t < -1.19999999999999994e109 or 1.7499999999999999e79 < t

   1. Initial program 82.4%

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 88.0

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

      8. lift-+.f64 N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. lift-/.f64 N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-/l* N/A

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

      16. lower-fma.f64 N/A

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

      17. lower-/.f64 N/A

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

      18. lower-+.f64 96.4

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

   3. Applied rewrites 96.4%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lift-+.f64 66.5

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

   6. Applied rewrites 66.5%

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

   7. Taylor expanded in a around 0

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

   9. Applied rewrites 31.5%

      \[\leadsto x \]

   if -1.19999999999999994e109 < t < 1.7499999999999999e79

   1. Initial program 70.3%

      \[\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 46.1

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

   4. Applied rewrites 46.1%

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

Alternative 17: 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.5%

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

   2. lift-*.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. +-commutative N/A

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

   5. associate-/l* N/A

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

   6. lower-fma.f64 N/A

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

   7. lower-/.f64 73.2

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

   8. lift-+.f64 N/A

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

   9. lift-+.f64 N/A

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

   10. +-commutative N/A

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

   11. lift-*.f64 N/A

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

   12. lift-/.f64 N/A

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

   13. +-commutative N/A

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

   14. *-commutative N/A

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

   15. associate-/l* N/A

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

   16. lower-fma.f64 N/A

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

   17. lower-/.f64 N/A

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

   18. lower-+.f64 73.7

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

3. Applied rewrites 73.7%

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

4. Taylor expanded in y around 0

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

   1. lower-/.f64 N/A

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

   2. lift-+.f64 41.1

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

6. Applied rewrites 41.1%

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

7. Taylor expanded in a around 0

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

9. Applied rewrites 19.5%

   \[\leadsto x \]
10. Add Preprocessing

Developer Target 1: 78.4% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	double tmp;
	if (t < -1.3659085366310088e-271) {
		tmp = t_1;
	} else if (t < 3.036967103737246e-130) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	double tmp;
	if (t < -1.3659085366310088e-271) {
		tmp = t_1;
	} else if (t < 3.036967103737246e-130) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2025107 
(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))))