Data.HashTable.ST.Basic:computeOverhead from hashtables-1.2.0.2

Percentage Accurate: 86.8% → 99.5%

Time: 7.6s

Alternatives: 15

Speedup: 1.0×

• 23.9% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (/ x y) (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x / y) + ((2.0d0 + ((z * 2.0d0) * (1.0d0 - t))) / (t * z))
end function

Java

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

Python

def code(x, y, z, t):
	return (x / y) + ((2.0 + ((z * 2.0) * (1.0 - t))) / (t * z))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 86.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (/ x y) (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x / y) + ((2.0d0 + ((z * 2.0d0) * (1.0d0 - t))) / (t * z))
end function

Java

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

Python

def code(x, y, z, t):
	return (x / y) + ((2.0 + ((z * 2.0) * (1.0 - t))) / (t * z))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) (- INFINITY))
   (/ (fma (/ 2.0 z) y (* x t)) (* y t))
   (+ (/ (fma -2.0 (- t 1.0) (/ 2.0 z)) t) (/ x y))))

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], (-Infinity)], N[(N[(N[(2.0 / z), $MachinePrecision] * y + N[(x * t), $MachinePrecision]), $MachinePrecision] / N[(y * t), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-2.0 * N[(t - 1.0), $MachinePrecision] + N[(2.0 / z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] + N[(x / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -inf.0

   1. Initial program 86.8%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 64.3%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/r* N/A

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

      7. lift-/.f64 N/A

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

      8. frac-add N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 51.1

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

   6. Applied rewrites 51.1%

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

   if -inf.0 < (/.f64 x y)

   1. Initial program 86.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-+.f64 86.8

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

   3. Applied rewrites 99.1%

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

Alternative 2: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\mathsf{fma}\left(-2, t - 1, \frac{2}{z}\right), \frac{1}{t}, \frac{x}{y}\right) \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (fma (fma -2.0 (- t 1.0) (/ 2.0 z)) (/ 1.0 t) (/ x y)))

C

double code(double x, double y, double z, double t) {
	return fma(fma(-2.0, (t - 1.0), (2.0 / z)), (1.0 / t), (x / y));
}

Julia

function code(x, y, z, t)
	return fma(fma(-2.0, Float64(t - 1.0), Float64(2.0 / z)), Float64(1.0 / t), Float64(x / y))
end

Wolfram

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

Derivation

1. Initial program 86.8%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. mult-flip N/A

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

   5. associate-*r/ N/A

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

   6. lift-*.f64 N/A

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

   7. *-commutative N/A

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

   8. times-frac N/A

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

   9. lower-fma.f64 N/A

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

3. Applied rewrites 99.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(-2, t - 1, \frac{2}{z}\right), \frac{1}{t}, \frac{x}{y}\right)} \]
4. Add Preprocessing

Alternative 3: 98.6% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (/ x y) (/ (+ 2.0 (* 2.0 z)) (* t z)))))
   (if (<= (/ x y) (- INFINITY))
     (/ (fma (/ 2.0 z) y (* x t)) (* y t))
     (if (<= (/ x y) -500000.0)
       t_1
       (if (<= (/ x y) 5e-5) (/ (fma (- 1.0 t) 2.0 (/ 2.0 z)) t) t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) + ((2.0 + (2.0 * z)) / (t * z));
	double tmp;
	if ((x / y) <= -((double) INFINITY)) {
		tmp = fma((2.0 / z), y, (x * t)) / (y * t);
	} else if ((x / y) <= -500000.0) {
		tmp = t_1;
	} else if ((x / y) <= 5e-5) {
		tmp = fma((1.0 - t), 2.0, (2.0 / z)) / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -inf.0

   1. Initial program 86.8%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 64.3%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/r* N/A

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

      7. lift-/.f64 N/A

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

      8. frac-add N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 51.1

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

   6. Applied rewrites 51.1%

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

   if -inf.0 < (/.f64 x y) < -5e5 or 5.00000000000000024e-5 < (/.f64 x y)

   1. Initial program 86.8%

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

   2. Taylor expanded in t around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 80.9

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

   4. Applied rewrites 80.9%

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

   if -5e5 < (/.f64 x y) < 5.00000000000000024e-5

   1. Initial program 86.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 65.8

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

   4. Applied rewrites 65.8%

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

      1. lift-fma.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} + \color{blue}{2 \cdot \frac{1}{t \cdot z}} \]

      2. lift-/.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      3. associate-*r/ N/A

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

      4. lift--.f64 N/A

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

      5. sub-negate-rev N/A

         \[\leadsto \frac{2 \cdot \left(\mathsf{neg}\left(\left(t - 1\right)\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      6. lift--.f64 N/A

         \[\leadsto \frac{2 \cdot \left(\mathsf{neg}\left(\left(t - 1\right)\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

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

         \[\leadsto \frac{\mathsf{neg}\left(2 \cdot \left(t - 1\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

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

         \[\leadsto \frac{\left(\mathsf{neg}\left(2\right)\right) \cdot \left(t - 1\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      9. metadata-eval N/A

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

      10. lift-*.f64 N/A

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

      11. lift-/.f64 N/A

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

      12. mult-flip-rev N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. associate-/l/ N/A

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

      16. mult-flip-rev N/A

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

      17. lift-/.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. div-add N/A

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

   6. Applied rewrites 65.7%

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

Alternative 4: 90.7% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -1e-6)
   (fma 2.0 (/ (- 1.0 t) t) (/ x y))
   (if (<= (/ x y) 2e+42)
     (/ (fma (- 1.0 t) 2.0 (/ 2.0 z)) t)
     (+ (/ x y) (/ (/ 2.0 t) z)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -1e-6) {
		tmp = fma(2.0, ((1.0 - t) / t), (x / y));
	} else if ((x / y) <= 2e+42) {
		tmp = fma((1.0 - t), 2.0, (2.0 / z)) / t;
	} else {
		tmp = (x / y) + ((2.0 / t) / z);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -1e-6)
		tmp = fma(2.0, Float64(Float64(1.0 - t) / t), Float64(x / y));
	elseif (Float64(x / y) <= 2e+42)
		tmp = Float64(fma(Float64(1.0 - t), 2.0, Float64(2.0 / z)) / t);
	else
		tmp = Float64(Float64(x / y) + Float64(Float64(2.0 / t) / z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -1e-6], N[(2.0 * N[(N[(1.0 - t), $MachinePrecision] / t), $MachinePrecision] + N[(x / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 2e+42], N[(N[(N[(1.0 - t), $MachinePrecision] * 2.0 + N[(2.0 / z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision], N[(N[(x / y), $MachinePrecision] + N[(N[(2.0 / t), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -9.99999999999999955e-7

   1. Initial program 86.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 70.6

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

   4. Applied rewrites 70.6%

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

   if -9.99999999999999955e-7 < (/.f64 x y) < 2.00000000000000009e42

   1. Initial program 86.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 65.8

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

   4. Applied rewrites 65.8%

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

      1. lift-fma.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} + \color{blue}{2 \cdot \frac{1}{t \cdot z}} \]

      2. lift-/.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      3. associate-*r/ N/A

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

      4. lift--.f64 N/A

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

      5. sub-negate-rev N/A

         \[\leadsto \frac{2 \cdot \left(\mathsf{neg}\left(\left(t - 1\right)\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      6. lift--.f64 N/A

         \[\leadsto \frac{2 \cdot \left(\mathsf{neg}\left(\left(t - 1\right)\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

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

         \[\leadsto \frac{\mathsf{neg}\left(2 \cdot \left(t - 1\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

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

         \[\leadsto \frac{\left(\mathsf{neg}\left(2\right)\right) \cdot \left(t - 1\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      9. metadata-eval N/A

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

      10. lift-*.f64 N/A

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

      11. lift-/.f64 N/A

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

      12. mult-flip-rev N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. associate-/l/ N/A

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

      16. mult-flip-rev N/A

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

      17. lift-/.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. div-add N/A

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

   6. Applied rewrites 65.7%

      \[\leadsto \frac{\mathsf{fma}\left(1 - t, 2, \frac{2}{z}\right)}{\color{blue}{t}} \]

   if 2.00000000000000009e42 < (/.f64 x y)

   1. Initial program 86.8%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 64.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 64.3

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

   6. Applied rewrites 64.3%

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

Alternative 5: 90.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -850000:\\ \;\;\;\;\mathsf{fma}\left(2, \frac{1}{t}, \frac{x}{y}\right)\\ \mathbf{elif}\;\frac{x}{y} \leq 1.9 \cdot 10^{+42}:\\ \;\;\;\;\frac{\mathsf{fma}\left(1 - t, 2, \frac{2}{z}\right)}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + \frac{\frac{2}{t}}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -850000.0)
   (fma 2.0 (/ 1.0 t) (/ x y))
   (if (<= (/ x y) 1.9e+42)
     (/ (fma (- 1.0 t) 2.0 (/ 2.0 z)) t)
     (+ (/ x y) (/ (/ 2.0 t) z)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -850000.0) {
		tmp = fma(2.0, (1.0 / t), (x / y));
	} else if ((x / y) <= 1.9e+42) {
		tmp = fma((1.0 - t), 2.0, (2.0 / z)) / t;
	} else {
		tmp = (x / y) + ((2.0 / t) / z);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -850000.0)
		tmp = fma(2.0, Float64(1.0 / t), Float64(x / y));
	elseif (Float64(x / y) <= 1.9e+42)
		tmp = Float64(fma(Float64(1.0 - t), 2.0, Float64(2.0 / z)) / t);
	else
		tmp = Float64(Float64(x / y) + Float64(Float64(2.0 / t) / z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -850000.0], N[(2.0 * N[(1.0 / t), $MachinePrecision] + N[(x / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 1.9e+42], N[(N[(N[(1.0 - t), $MachinePrecision] * 2.0 + N[(2.0 / z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision], N[(N[(x / y), $MachinePrecision] + N[(N[(2.0 / t), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -8.5e5

   1. Initial program 86.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 70.6

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

   4. Applied rewrites 70.6%

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

   5. Taylor expanded in t around 0

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

   7. Applied rewrites 52.9%

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

   if -8.5e5 < (/.f64 x y) < 1.8999999999999999e42

   1. Initial program 86.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 65.8

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

   4. Applied rewrites 65.8%

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

      1. lift-fma.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} + \color{blue}{2 \cdot \frac{1}{t \cdot z}} \]

      2. lift-/.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      3. associate-*r/ N/A

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

      4. lift--.f64 N/A

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

      5. sub-negate-rev N/A

         \[\leadsto \frac{2 \cdot \left(\mathsf{neg}\left(\left(t - 1\right)\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      6. lift--.f64 N/A

         \[\leadsto \frac{2 \cdot \left(\mathsf{neg}\left(\left(t - 1\right)\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

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

         \[\leadsto \frac{\mathsf{neg}\left(2 \cdot \left(t - 1\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

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

         \[\leadsto \frac{\left(\mathsf{neg}\left(2\right)\right) \cdot \left(t - 1\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      9. metadata-eval N/A

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

      10. lift-*.f64 N/A

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

      11. lift-/.f64 N/A

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

      12. mult-flip-rev N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. associate-/l/ N/A

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

      16. mult-flip-rev N/A

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

      17. lift-/.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. div-add N/A

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

   6. Applied rewrites 65.7%

      \[\leadsto \frac{\mathsf{fma}\left(1 - t, 2, \frac{2}{z}\right)}{\color{blue}{t}} \]

   if 1.8999999999999999e42 < (/.f64 x y)

   1. Initial program 86.8%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 64.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 64.3

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

   6. Applied rewrites 64.3%

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

Alternative 6: 86.4% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (/ x y) 2.0))
        (t_2 (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))
   (if (<= t_2 -2e+137)
     (/ (- (/ 2.0 z) -2.0) t)
     (if (<= t_2 -200000000.0)
       (fma 2.0 (/ 1.0 t) (/ x y))
       (if (<= t_2 -1.9999999998)
         t_1
         (if (<= t_2 2e+150)
           (+ (/ x y) (/ (/ 2.0 t) z))
           (if (<= t_2 INFINITY) (- (/ 2.0 t) (/ -2.0 (* z t))) t_1)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) - 2.0;
	double t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	double tmp;
	if (t_2 <= -2e+137) {
		tmp = ((2.0 / z) - -2.0) / t;
	} else if (t_2 <= -200000000.0) {
		tmp = fma(2.0, (1.0 / t), (x / y));
	} else if (t_2 <= -1.9999999998) {
		tmp = t_1;
	} else if (t_2 <= 2e+150) {
		tmp = (x / y) + ((2.0 / t) / z);
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = (2.0 / t) - (-2.0 / (z * t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) - 2.0)
	t_2 = Float64(Float64(2.0 + Float64(Float64(z * 2.0) * Float64(1.0 - t))) / Float64(t * z))
	tmp = 0.0
	if (t_2 <= -2e+137)
		tmp = Float64(Float64(Float64(2.0 / z) - -2.0) / t);
	elseif (t_2 <= -200000000.0)
		tmp = fma(2.0, Float64(1.0 / t), Float64(x / y));
	elseif (t_2 <= -1.9999999998)
		tmp = t_1;
	elseif (t_2 <= 2e+150)
		tmp = Float64(Float64(x / y) + Float64(Float64(2.0 / t) / z));
	elseif (t_2 <= Inf)
		tmp = Float64(Float64(2.0 / t) - Float64(-2.0 / Float64(z * t)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 + N[(N[(z * 2.0), $MachinePrecision] * N[(1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+137], N[(N[(N[(2.0 / z), $MachinePrecision] - -2.0), $MachinePrecision] / t), $MachinePrecision], If[LessEqual[t$95$2, -200000000.0], N[(2.0 * N[(1.0 / t), $MachinePrecision] + N[(x / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1.9999999998], t$95$1, If[LessEqual[t$95$2, 2e+150], N[(N[(x / y), $MachinePrecision] + N[(N[(2.0 / t), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[(2.0 / t), $MachinePrecision] - N[(-2.0 / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]

Derivation

1. Split input into 5 regimes

2. if (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -2.0000000000000001e137

   1. Initial program 86.8%

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

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 48.2

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

   4. Applied rewrites 48.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. add-flip N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - \left(\mathsf{neg}\left(2\right)\right)}{t} \]

      4. metadata-eval N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      5. lower--.f64 48.2

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      7. lift-/.f64 N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      8. mult-flip-rev N/A

         \[\leadsto \frac{\frac{2}{z} - -2}{t} \]

      9. lift-/.f64 48.2

         \[\leadsto \frac{\frac{2}{z} - -2}{t} \]

   6. Applied rewrites 48.2%

      \[\leadsto \color{blue}{\frac{\frac{2}{z} - -2}{t}} \]

   if -2.0000000000000001e137 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -2e8

   1. Initial program 86.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 70.6

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

   4. Applied rewrites 70.6%

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

   5. Taylor expanded in t around 0

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

   7. Applied rewrites 52.9%

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

   if -2e8 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -1.9999999998 or +inf.0 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z))

   1. Initial program 86.8%

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

   2. Taylor expanded in t around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 54.0

         \[\leadsto \frac{x}{y} - 2 \]

   4. Applied rewrites 54.0%

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

   if -1.9999999998 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < 1.99999999999999996e150

   1. Initial program 86.8%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 64.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 64.3

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

   6. Applied rewrites 64.3%

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

   if 1.99999999999999996e150 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < +inf.0

   1. Initial program 86.8%

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

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 48.2

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

   4. Applied rewrites 48.2%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. div-add N/A

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

      4. lift-*.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. mult-flip-rev N/A

         \[\leadsto \frac{2}{t} + \frac{\frac{2}{z}}{t} \]

      7. associate-/l/ N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. mult-flip-rev N/A

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

      11. lift-/.f64 N/A

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

      12. lift-*.f64 N/A

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

      13. add-flip N/A

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

      14. lower--.f64 N/A

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

      15. lower-/.f64 N/A

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

      16. lift-*.f64 N/A

          \[\leadsto \frac{2}{t} - \left(\mathsf{neg}\left(2 \cdot \frac{1}{t \cdot z}\right)\right) \]

      17. lift-/.f64 N/A

          \[\leadsto \frac{2}{t} - \left(\mathsf{neg}\left(2 \cdot \frac{1}{t \cdot z}\right)\right) \]

      18. mult-flip-rev N/A

          \[\leadsto \frac{2}{t} - \left(\mathsf{neg}\left(\frac{2}{t \cdot z}\right)\right) \]

      19. distribute-neg-frac N/A

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

      20. metadata-eval N/A

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

      21. lower-/.f64 48.2

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

      22. lift-*.f64 N/A

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

      23. *-commutative N/A

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

      24. lower-*.f64 48.2

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

   6. Applied rewrites 48.2%

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

Alternative 7: 86.3% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (/ x y) 2.0))
        (t_2 (/ (- (/ 2.0 z) -2.0) t))
        (t_3 (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))
   (if (<= t_3 -2e+137)
     t_2
     (if (<= t_3 -200000000.0)
       (fma 2.0 (/ 1.0 t) (/ x y))
       (if (<= t_3 -1.9999999998)
         t_1
         (if (<= t_3 2e+151)
           (+ (/ x y) (/ 2.0 (* t z)))
           (if (<= t_3 INFINITY) t_2 t_1)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) - 2.0;
	double t_2 = ((2.0 / z) - -2.0) / t;
	double t_3 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	double tmp;
	if (t_3 <= -2e+137) {
		tmp = t_2;
	} else if (t_3 <= -200000000.0) {
		tmp = fma(2.0, (1.0 / t), (x / y));
	} else if (t_3 <= -1.9999999998) {
		tmp = t_1;
	} else if (t_3 <= 2e+151) {
		tmp = (x / y) + (2.0 / (t * z));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) - 2.0)
	t_2 = Float64(Float64(Float64(2.0 / z) - -2.0) / t)
	t_3 = Float64(Float64(2.0 + Float64(Float64(z * 2.0) * Float64(1.0 - t))) / Float64(t * z))
	tmp = 0.0
	if (t_3 <= -2e+137)
		tmp = t_2;
	elseif (t_3 <= -200000000.0)
		tmp = fma(2.0, Float64(1.0 / t), Float64(x / y));
	elseif (t_3 <= -1.9999999998)
		tmp = t_1;
	elseif (t_3 <= 2e+151)
		tmp = Float64(Float64(x / y) + Float64(2.0 / Float64(t * z)));
	elseif (t_3 <= Inf)
		tmp = t_2;
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(2.0 / z), $MachinePrecision] - -2.0), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 + N[(N[(z * 2.0), $MachinePrecision] * N[(1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+137], t$95$2, If[LessEqual[t$95$3, -200000000.0], N[(2.0 * N[(1.0 / t), $MachinePrecision] + N[(x / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -1.9999999998], t$95$1, If[LessEqual[t$95$3, 2e+151], N[(N[(x / y), $MachinePrecision] + N[(2.0 / N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$2, t$95$1]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -2.0000000000000001e137 or 2.00000000000000003e151 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < +inf.0

   1. Initial program 86.8%

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

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 48.2

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

   4. Applied rewrites 48.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. add-flip N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - \left(\mathsf{neg}\left(2\right)\right)}{t} \]

      4. metadata-eval N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      5. lower--.f64 48.2

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      7. lift-/.f64 N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      8. mult-flip-rev N/A

         \[\leadsto \frac{\frac{2}{z} - -2}{t} \]

      9. lift-/.f64 48.2

         \[\leadsto \frac{\frac{2}{z} - -2}{t} \]

   6. Applied rewrites 48.2%

      \[\leadsto \color{blue}{\frac{\frac{2}{z} - -2}{t}} \]

   if -2.0000000000000001e137 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -2e8

   1. Initial program 86.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 70.6

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

   4. Applied rewrites 70.6%

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

   5. Taylor expanded in t around 0

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

   7. Applied rewrites 52.9%

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

   if -2e8 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -1.9999999998 or +inf.0 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z))

   1. Initial program 86.8%

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

   2. Taylor expanded in t around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 54.0

         \[\leadsto \frac{x}{y} - 2 \]

   4. Applied rewrites 54.0%

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

   if -1.9999999998 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < 2.00000000000000003e151

   1. Initial program 86.8%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 64.3%

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

Alternative 8: 85.5% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (/ x y) 2.0))
        (t_2 (/ (- (/ 2.0 z) -2.0) t))
        (t_3 (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))
   (if (<= t_3 -2e+137)
     t_2
     (if (<= t_3 -200000000.0)
       (fma 2.0 (/ 1.0 t) (/ x y))
       (if (<= t_3 5000.0) t_1 (if (<= t_3 INFINITY) t_2 t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) - 2.0;
	double t_2 = ((2.0 / z) - -2.0) / t;
	double t_3 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	double tmp;
	if (t_3 <= -2e+137) {
		tmp = t_2;
	} else if (t_3 <= -200000000.0) {
		tmp = fma(2.0, (1.0 / t), (x / y));
	} else if (t_3 <= 5000.0) {
		tmp = t_1;
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) - 2.0)
	t_2 = Float64(Float64(Float64(2.0 / z) - -2.0) / t)
	t_3 = Float64(Float64(2.0 + Float64(Float64(z * 2.0) * Float64(1.0 - t))) / Float64(t * z))
	tmp = 0.0
	if (t_3 <= -2e+137)
		tmp = t_2;
	elseif (t_3 <= -200000000.0)
		tmp = fma(2.0, Float64(1.0 / t), Float64(x / y));
	elseif (t_3 <= 5000.0)
		tmp = t_1;
	elseif (t_3 <= Inf)
		tmp = t_2;
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(2.0 / z), $MachinePrecision] - -2.0), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$3 = N[(N[(2.0 + N[(N[(z * 2.0), $MachinePrecision] * N[(1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+137], t$95$2, If[LessEqual[t$95$3, -200000000.0], N[(2.0 * N[(1.0 / t), $MachinePrecision] + N[(x / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 5000.0], t$95$1, If[LessEqual[t$95$3, Infinity], t$95$2, t$95$1]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -2.0000000000000001e137 or 5e3 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < +inf.0

   1. Initial program 86.8%

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

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 48.2

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

   4. Applied rewrites 48.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. add-flip N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - \left(\mathsf{neg}\left(2\right)\right)}{t} \]

      4. metadata-eval N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      5. lower--.f64 48.2

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      7. lift-/.f64 N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      8. mult-flip-rev N/A

         \[\leadsto \frac{\frac{2}{z} - -2}{t} \]

      9. lift-/.f64 48.2

         \[\leadsto \frac{\frac{2}{z} - -2}{t} \]

   6. Applied rewrites 48.2%

      \[\leadsto \color{blue}{\frac{\frac{2}{z} - -2}{t}} \]

   if -2.0000000000000001e137 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -2e8

   1. Initial program 86.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 70.6

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

   4. Applied rewrites 70.6%

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

   5. Taylor expanded in t around 0

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

   7. Applied rewrites 52.9%

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

   if -2e8 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < 5e3 or +inf.0 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z))

   1. Initial program 86.8%

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

   2. Taylor expanded in t around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 54.0

         \[\leadsto \frac{x}{y} - 2 \]

   4. Applied rewrites 54.0%

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

Alternative 9: 84.6% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- (/ 2.0 z) -2.0) t))
        (t_2 (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z)))
        (t_3 (- (/ x y) 2.0)))
   (if (<= t_2 -1e+51)
     t_1
     (if (<= t_2 5000.0) t_3 (if (<= t_2 INFINITY) t_1 t_3)))))

C

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

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = ((2.0 / z) - -2.0) / t;
	double t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	double t_3 = (x / y) - 2.0;
	double tmp;
	if (t_2 <= -1e+51) {
		tmp = t_1;
	} else if (t_2 <= 5000.0) {
		tmp = t_3;
	} else if (t_2 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = ((2.0 / z) - -2.0) / t
	t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z)
	t_3 = (x / y) - 2.0
	tmp = 0
	if t_2 <= -1e+51:
		tmp = t_1
	elif t_2 <= 5000.0:
		tmp = t_3
	elif t_2 <= math.inf:
		tmp = t_1
	else:
		tmp = t_3
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = ((2.0 / z) - -2.0) / t;
	t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	t_3 = (x / y) - 2.0;
	tmp = 0.0;
	if (t_2 <= -1e+51)
		tmp = t_1;
	elseif (t_2 <= 5000.0)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -1e51 or 5e3 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < +inf.0

   1. Initial program 86.8%

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

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 48.2

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

   4. Applied rewrites 48.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. add-flip N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - \left(\mathsf{neg}\left(2\right)\right)}{t} \]

      4. metadata-eval N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      5. lower--.f64 48.2

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      7. lift-/.f64 N/A

         \[\leadsto \frac{2 \cdot \frac{1}{z} - -2}{t} \]

      8. mult-flip-rev N/A

         \[\leadsto \frac{\frac{2}{z} - -2}{t} \]

      9. lift-/.f64 48.2

         \[\leadsto \frac{\frac{2}{z} - -2}{t} \]

   6. Applied rewrites 48.2%

      \[\leadsto \color{blue}{\frac{\frac{2}{z} - -2}{t}} \]

   if -1e51 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < 5e3 or +inf.0 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z))

   1. Initial program 86.8%

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

   2. Taylor expanded in t around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 54.0

         \[\leadsto \frac{x}{y} - 2 \]

   4. Applied rewrites 54.0%

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

Alternative 10: 69.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\frac{2}{z}}{t}\\ t_2 := \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z}\\ t_3 := \frac{x}{y} - 2\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+224}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq -1 \cdot 10^{+51}:\\ \;\;\;\;2 \cdot \frac{1 - t}{t}\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+125}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (/ 2.0 z) t))
        (t_2 (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z)))
        (t_3 (- (/ x y) 2.0)))
   (if (<= t_2 -5e+224)
     t_1
     (if (<= t_2 -1e+51)
       (* 2.0 (/ (- 1.0 t) t))
       (if (<= t_2 5e+125) t_3 (if (<= t_2 INFINITY) t_1 t_3))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (2.0 / z) / t;
	double t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	double t_3 = (x / y) - 2.0;
	double tmp;
	if (t_2 <= -5e+224) {
		tmp = t_1;
	} else if (t_2 <= -1e+51) {
		tmp = 2.0 * ((1.0 - t) / t);
	} else if (t_2 <= 5e+125) {
		tmp = t_3;
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (2.0 / z) / t;
	double t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	double t_3 = (x / y) - 2.0;
	double tmp;
	if (t_2 <= -5e+224) {
		tmp = t_1;
	} else if (t_2 <= -1e+51) {
		tmp = 2.0 * ((1.0 - t) / t);
	} else if (t_2 <= 5e+125) {
		tmp = t_3;
	} else if (t_2 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (2.0 / z) / t
	t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z)
	t_3 = (x / y) - 2.0
	tmp = 0
	if t_2 <= -5e+224:
		tmp = t_1
	elif t_2 <= -1e+51:
		tmp = 2.0 * ((1.0 - t) / t)
	elif t_2 <= 5e+125:
		tmp = t_3
	elif t_2 <= math.inf:
		tmp = t_1
	else:
		tmp = t_3
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(2.0 / z) / t)
	t_2 = Float64(Float64(2.0 + Float64(Float64(z * 2.0) * Float64(1.0 - t))) / Float64(t * z))
	t_3 = Float64(Float64(x / y) - 2.0)
	tmp = 0.0
	if (t_2 <= -5e+224)
		tmp = t_1;
	elseif (t_2 <= -1e+51)
		tmp = Float64(2.0 * Float64(Float64(1.0 - t) / t));
	elseif (t_2 <= 5e+125)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = t_3;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (2.0 / z) / t;
	t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	t_3 = (x / y) - 2.0;
	tmp = 0.0;
	if (t_2 <= -5e+224)
		tmp = t_1;
	elseif (t_2 <= -1e+51)
		tmp = 2.0 * ((1.0 - t) / t);
	elseif (t_2 <= 5e+125)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(2.0 / z), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 + N[(N[(z * 2.0), $MachinePrecision] * N[(1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+224], t$95$1, If[LessEqual[t$95$2, -1e+51], N[(2.0 * N[(N[(1.0 - t), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e+125], t$95$3, If[LessEqual[t$95$2, Infinity], t$95$1, t$95$3]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -4.99999999999999964e224 or 4.99999999999999962e125 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < +inf.0

   1. Initial program 86.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 65.8

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

   4. Applied rewrites 65.8%

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

      1. lift-fma.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} + \color{blue}{2 \cdot \frac{1}{t \cdot z}} \]

      2. lift-/.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      3. associate-*r/ N/A

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

      4. lift--.f64 N/A

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

      5. sub-negate-rev N/A

         \[\leadsto \frac{2 \cdot \left(\mathsf{neg}\left(\left(t - 1\right)\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      6. lift--.f64 N/A

         \[\leadsto \frac{2 \cdot \left(\mathsf{neg}\left(\left(t - 1\right)\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

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

         \[\leadsto \frac{\mathsf{neg}\left(2 \cdot \left(t - 1\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

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

         \[\leadsto \frac{\left(\mathsf{neg}\left(2\right)\right) \cdot \left(t - 1\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      9. metadata-eval N/A

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

      10. lift-*.f64 N/A

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

      11. lift-/.f64 N/A

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

      12. mult-flip-rev N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. associate-/l/ N/A

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

      16. mult-flip-rev N/A

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

      17. lift-/.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. div-add N/A

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

   6. Applied rewrites 65.7%

      \[\leadsto \frac{\mathsf{fma}\left(1 - t, 2, \frac{2}{z}\right)}{\color{blue}{t}} \]

   7. Taylor expanded in z around 0

      \[\leadsto \frac{\frac{2}{z}}{t} \]
   8. Step-by-step derivation

      1. lower-/.f64 31.6

         \[\leadsto \frac{\frac{2}{z}}{t} \]

   9. Applied rewrites 31.6%

      \[\leadsto \frac{\frac{2}{z}}{t} \]

   if -4.99999999999999964e224 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -1e51

   1. Initial program 86.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 70.6

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

   4. Applied rewrites 70.6%

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

   5. Taylor expanded in x around 0

      \[\leadsto 2 \cdot \color{blue}{\frac{1 - t}{t}} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{\color{blue}{t}} \]

      2. lower-/.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} \]

      3. lower--.f64 36.1

         \[\leadsto 2 \cdot \frac{1 - t}{t} \]

   7. Applied rewrites 36.1%

      \[\leadsto 2 \cdot \color{blue}{\frac{1 - t}{t}} \]

   if -1e51 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < 4.99999999999999962e125 or +inf.0 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z))

   1. Initial program 86.8%

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

   2. Taylor expanded in t around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 54.0

         \[\leadsto \frac{x}{y} - 2 \]

   4. Applied rewrites 54.0%

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

Alternative 11: 69.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\frac{2}{z}}{t}\\ t_2 := \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z}\\ t_3 := \frac{x}{y} - 2\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+224}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq -1 \cdot 10^{+51}:\\ \;\;\;\;\frac{2}{t}\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+125}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (/ 2.0 z) t))
        (t_2 (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z)))
        (t_3 (- (/ x y) 2.0)))
   (if (<= t_2 -5e+224)
     t_1
     (if (<= t_2 -1e+51)
       (/ 2.0 t)
       (if (<= t_2 5e+125) t_3 (if (<= t_2 INFINITY) t_1 t_3))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (2.0 / z) / t;
	double t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	double t_3 = (x / y) - 2.0;
	double tmp;
	if (t_2 <= -5e+224) {
		tmp = t_1;
	} else if (t_2 <= -1e+51) {
		tmp = 2.0 / t;
	} else if (t_2 <= 5e+125) {
		tmp = t_3;
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (2.0 / z) / t;
	double t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	double t_3 = (x / y) - 2.0;
	double tmp;
	if (t_2 <= -5e+224) {
		tmp = t_1;
	} else if (t_2 <= -1e+51) {
		tmp = 2.0 / t;
	} else if (t_2 <= 5e+125) {
		tmp = t_3;
	} else if (t_2 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (2.0 / z) / t
	t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z)
	t_3 = (x / y) - 2.0
	tmp = 0
	if t_2 <= -5e+224:
		tmp = t_1
	elif t_2 <= -1e+51:
		tmp = 2.0 / t
	elif t_2 <= 5e+125:
		tmp = t_3
	elif t_2 <= math.inf:
		tmp = t_1
	else:
		tmp = t_3
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(2.0 / z) / t)
	t_2 = Float64(Float64(2.0 + Float64(Float64(z * 2.0) * Float64(1.0 - t))) / Float64(t * z))
	t_3 = Float64(Float64(x / y) - 2.0)
	tmp = 0.0
	if (t_2 <= -5e+224)
		tmp = t_1;
	elseif (t_2 <= -1e+51)
		tmp = Float64(2.0 / t);
	elseif (t_2 <= 5e+125)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = t_3;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (2.0 / z) / t;
	t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	t_3 = (x / y) - 2.0;
	tmp = 0.0;
	if (t_2 <= -5e+224)
		tmp = t_1;
	elseif (t_2 <= -1e+51)
		tmp = 2.0 / t;
	elseif (t_2 <= 5e+125)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(2.0 / z), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 + N[(N[(z * 2.0), $MachinePrecision] * N[(1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+224], t$95$1, If[LessEqual[t$95$2, -1e+51], N[(2.0 / t), $MachinePrecision], If[LessEqual[t$95$2, 5e+125], t$95$3, If[LessEqual[t$95$2, Infinity], t$95$1, t$95$3]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -4.99999999999999964e224 or 4.99999999999999962e125 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < +inf.0

   1. Initial program 86.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 65.8

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

   4. Applied rewrites 65.8%

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

      1. lift-fma.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} + \color{blue}{2 \cdot \frac{1}{t \cdot z}} \]

      2. lift-/.f64 N/A

         \[\leadsto 2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      3. associate-*r/ N/A

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

      4. lift--.f64 N/A

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

      5. sub-negate-rev N/A

         \[\leadsto \frac{2 \cdot \left(\mathsf{neg}\left(\left(t - 1\right)\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      6. lift--.f64 N/A

         \[\leadsto \frac{2 \cdot \left(\mathsf{neg}\left(\left(t - 1\right)\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

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

         \[\leadsto \frac{\mathsf{neg}\left(2 \cdot \left(t - 1\right)\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

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

         \[\leadsto \frac{\left(\mathsf{neg}\left(2\right)\right) \cdot \left(t - 1\right)}{t} + 2 \cdot \frac{1}{t \cdot z} \]

      9. metadata-eval N/A

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

      10. lift-*.f64 N/A

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

      11. lift-/.f64 N/A

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

      12. mult-flip-rev N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. associate-/l/ N/A

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

      16. mult-flip-rev N/A

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

      17. lift-/.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. div-add N/A

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

   6. Applied rewrites 65.7%

      \[\leadsto \frac{\mathsf{fma}\left(1 - t, 2, \frac{2}{z}\right)}{\color{blue}{t}} \]

   7. Taylor expanded in z around 0

      \[\leadsto \frac{\frac{2}{z}}{t} \]
   8. Step-by-step derivation

      1. lower-/.f64 31.6

         \[\leadsto \frac{\frac{2}{z}}{t} \]

   9. Applied rewrites 31.6%

      \[\leadsto \frac{\frac{2}{z}}{t} \]

   if -4.99999999999999964e224 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -1e51

   1. Initial program 86.8%

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

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 48.2

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

   4. Applied rewrites 48.2%

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

   5. Taylor expanded in z around inf

      \[\leadsto \frac{2}{t} \]
   6. Step-by-step derivation

   7. Applied rewrites 18.8%

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

   if -1e51 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < 4.99999999999999962e125 or +inf.0 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z))

   1. Initial program 86.8%

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

   2. Taylor expanded in t around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 54.0

         \[\leadsto \frac{x}{y} - 2 \]

   4. Applied rewrites 54.0%

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

Alternative 12: 69.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{2}{t \cdot z}\\ t_2 := \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z}\\ t_3 := \frac{x}{y} - 2\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+224}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq -1 \cdot 10^{+51}:\\ \;\;\;\;\frac{2}{t}\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+125}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ 2.0 (* t z)))
        (t_2 (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z)))
        (t_3 (- (/ x y) 2.0)))
   (if (<= t_2 -5e+224)
     t_1
     (if (<= t_2 -1e+51)
       (/ 2.0 t)
       (if (<= t_2 5e+125) t_3 (if (<= t_2 INFINITY) t_1 t_3))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = 2.0 / (t * z);
	double t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	double t_3 = (x / y) - 2.0;
	double tmp;
	if (t_2 <= -5e+224) {
		tmp = t_1;
	} else if (t_2 <= -1e+51) {
		tmp = 2.0 / t;
	} else if (t_2 <= 5e+125) {
		tmp = t_3;
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = 2.0 / (t * z);
	double t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	double t_3 = (x / y) - 2.0;
	double tmp;
	if (t_2 <= -5e+224) {
		tmp = t_1;
	} else if (t_2 <= -1e+51) {
		tmp = 2.0 / t;
	} else if (t_2 <= 5e+125) {
		tmp = t_3;
	} else if (t_2 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = 2.0 / (t * z)
	t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z)
	t_3 = (x / y) - 2.0
	tmp = 0
	if t_2 <= -5e+224:
		tmp = t_1
	elif t_2 <= -1e+51:
		tmp = 2.0 / t
	elif t_2 <= 5e+125:
		tmp = t_3
	elif t_2 <= math.inf:
		tmp = t_1
	else:
		tmp = t_3
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(2.0 / Float64(t * z))
	t_2 = Float64(Float64(2.0 + Float64(Float64(z * 2.0) * Float64(1.0 - t))) / Float64(t * z))
	t_3 = Float64(Float64(x / y) - 2.0)
	tmp = 0.0
	if (t_2 <= -5e+224)
		tmp = t_1;
	elseif (t_2 <= -1e+51)
		tmp = Float64(2.0 / t);
	elseif (t_2 <= 5e+125)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = t_3;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = 2.0 / (t * z);
	t_2 = (2.0 + ((z * 2.0) * (1.0 - t))) / (t * z);
	t_3 = (x / y) - 2.0;
	tmp = 0.0;
	if (t_2 <= -5e+224)
		tmp = t_1;
	elseif (t_2 <= -1e+51)
		tmp = 2.0 / t;
	elseif (t_2 <= 5e+125)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(2.0 / N[(t * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 + N[(N[(z * 2.0), $MachinePrecision] * N[(1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+224], t$95$1, If[LessEqual[t$95$2, -1e+51], N[(2.0 / t), $MachinePrecision], If[LessEqual[t$95$2, 5e+125], t$95$3, If[LessEqual[t$95$2, Infinity], t$95$1, t$95$3]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -4.99999999999999964e224 or 4.99999999999999962e125 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < +inf.0

   1. Initial program 86.8%

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

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{2}{\color{blue}{t \cdot z}} \]

      2. lower-*.f64 31.6

         \[\leadsto \frac{2}{t \cdot \color{blue}{z}} \]

   4. Applied rewrites 31.6%

      \[\leadsto \color{blue}{\frac{2}{t \cdot z}} \]

   if -4.99999999999999964e224 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -1e51

   1. Initial program 86.8%

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

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 48.2

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

   4. Applied rewrites 48.2%

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

   5. Taylor expanded in z around inf

      \[\leadsto \frac{2}{t} \]
   6. Step-by-step derivation

   7. Applied rewrites 18.8%

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

   if -1e51 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < 4.99999999999999962e125 or +inf.0 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z))

   1. Initial program 86.8%

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

   2. Taylor expanded in t around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 54.0

         \[\leadsto \frac{x}{y} - 2 \]

   4. Applied rewrites 54.0%

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

Alternative 13: 59.5% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{y} - 2\\ \mathbf{if}\;t \leq -1.1 \cdot 10^{-50}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 5.8 \cdot 10^{-203}:\\ \;\;\;\;\frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (/ x y) 2.0)))
   (if (<= t -1.1e-50) t_1 (if (<= t 5.8e-203) (/ 2.0 t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) - 2.0;
	double tmp;
	if (t <= -1.1e-50) {
		tmp = t_1;
	} else if (t <= 5.8e-203) {
		tmp = 2.0 / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
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) :: t_1
    real(8) :: tmp
    t_1 = (x / y) - 2.0d0
    if (t <= (-1.1d-50)) then
        tmp = t_1
    else if (t <= 5.8d-203) then
        tmp = 2.0d0 / t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x / y) - 2.0;
	double tmp;
	if (t <= -1.1e-50) {
		tmp = t_1;
	} else if (t <= 5.8e-203) {
		tmp = 2.0 / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x / y) - 2.0
	tmp = 0
	if t <= -1.1e-50:
		tmp = t_1
	elif t <= 5.8e-203:
		tmp = 2.0 / t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) - 2.0)
	tmp = 0.0
	if (t <= -1.1e-50)
		tmp = t_1;
	elseif (t <= 5.8e-203)
		tmp = Float64(2.0 / t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x / y) - 2.0;
	tmp = 0.0;
	if (t <= -1.1e-50)
		tmp = t_1;
	elseif (t <= 5.8e-203)
		tmp = 2.0 / t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision]}, If[LessEqual[t, -1.1e-50], t$95$1, If[LessEqual[t, 5.8e-203], N[(2.0 / t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -1.0999999999999999e-50 or 5.7999999999999998e-203 < t

   1. Initial program 86.8%

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

   2. Taylor expanded in t around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 54.0

         \[\leadsto \frac{x}{y} - 2 \]

   4. Applied rewrites 54.0%

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

   if -1.0999999999999999e-50 < t < 5.7999999999999998e-203

   1. Initial program 86.8%

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

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 48.2

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

   4. Applied rewrites 48.2%

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

   5. Taylor expanded in z around inf

      \[\leadsto \frac{2}{t} \]
   6. Step-by-step derivation

   7. Applied rewrites 18.8%

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

Alternative 14: 34.8% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -4.5 \cdot 10^{-5}:\\ \;\;\;\;-2\\ \mathbf{elif}\;t \leq 1.46 \cdot 10^{+36}:\\ \;\;\;\;\frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -4.5e-5) -2.0 (if (<= t 1.46e+36) (/ 2.0 t) -2.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -4.5e-5) {
		tmp = -2.0;
	} else if (t <= 1.46e+36) {
		tmp = 2.0 / t;
	} else {
		tmp = -2.0;
	}
	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)
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) :: tmp
    if (t <= (-4.5d-5)) then
        tmp = -2.0d0
    else if (t <= 1.46d+36) then
        tmp = 2.0d0 / t
    else
        tmp = -2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -4.5e-5) {
		tmp = -2.0;
	} else if (t <= 1.46e+36) {
		tmp = 2.0 / t;
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -4.5e-5:
		tmp = -2.0
	elif t <= 1.46e+36:
		tmp = 2.0 / t
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -4.5e-5)
		tmp = -2.0;
	elseif (t <= 1.46e+36)
		tmp = Float64(2.0 / t);
	else
		tmp = -2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -4.5e-5)
		tmp = -2.0;
	elseif (t <= 1.46e+36)
		tmp = 2.0 / t;
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -4.5e-5], -2.0, If[LessEqual[t, 1.46e+36], N[(2.0 / t), $MachinePrecision], -2.0]]

Derivation

1. Split input into 2 regimes

2. if t < -4.50000000000000028e-5 or 1.46e36 < t

   1. Initial program 86.8%

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

   2. Taylor expanded in t around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 54.0

         \[\leadsto \frac{x}{y} - 2 \]

   4. Applied rewrites 54.0%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 19.5%

      \[\leadsto -2 \]

   if -4.50000000000000028e-5 < t < 1.46e36

   1. Initial program 86.8%

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

   2. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 48.2

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

   4. Applied rewrites 48.2%

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

   5. Taylor expanded in z around inf

      \[\leadsto \frac{2}{t} \]
   6. Step-by-step derivation

   7. Applied rewrites 18.8%

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

Alternative 15: 19.5% accurate, 24.7× speedup

Math

\[\begin{array}{l} \\ -2 \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 -2.0)

C

double code(double x, double y, double z, double t) {
	return -2.0;
}

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

Java

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

Python

def code(x, y, z, t):
	return -2.0

Julia

function code(x, y, z, t)
	return -2.0
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = -2.0;
end

Wolfram

code[x_, y_, z_, t_] := -2.0

Derivation

1. Initial program 86.8%

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

2. Taylor expanded in t around inf

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

   1. lower--.f64 N/A

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

   2. lower-/.f64 54.0

      \[\leadsto \frac{x}{y} - 2 \]

4. Applied rewrites 54.0%

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

5. Taylor expanded in x around 0

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

7. Applied rewrites 19.5%

   \[\leadsto -2 \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025156 
(FPCore (x y z t)
  :name "Data.HashTable.ST.Basic:computeOverhead from hashtables-1.2.0.2"
  :precision binary64
  (+ (/ x y) (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))