Diagrams.Trail:splitAtParam from diagrams-lib-1.3.0.3, D

Percentage Accurate: 65.4% → 99.9%

Time: 3.8s

Alternatives: 12

Speedup: 2.0×

Specification

Math

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

FPCore

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

C

double code(double x, double y) {
	return 1.0 - (((1.0 - x) * y) / (y + 1.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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0 - (((1.0d0 - x) * y) / (y + 1.0d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 65.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	return 1.0 - (((1.0 - x) * y) / (y + 1.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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0 - (((1.0d0 - x) * y) / (y + 1.0d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 2 \cdot \left(y + 1\right)\\ \mathbf{if}\;y \leq -21000000000:\\ \;\;\;\;x - \frac{x - 1}{y}\\ \mathbf{elif}\;y \leq 2.15 \cdot 10^{+14}:\\ \;\;\;\;\frac{t\_0 - 2 \cdot \left(\left(1 - x\right) \cdot y\right)}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{-1}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* 2.0 (+ y 1.0))))
   (if (<= y -21000000000.0)
     (- x (/ (- x 1.0) y))
     (if (<= y 2.15e+14)
       (/ (- t_0 (* 2.0 (* (- 1.0 x) y))) t_0)
       (- x (/ -1.0 y))))))

C

double code(double x, double y) {
	double t_0 = 2.0 * (y + 1.0);
	double tmp;
	if (y <= -21000000000.0) {
		tmp = x - ((x - 1.0) / y);
	} else if (y <= 2.15e+14) {
		tmp = (t_0 - (2.0 * ((1.0 - x) * y))) / t_0;
	} else {
		tmp = x - (-1.0 / y);
	}
	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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 2.0d0 * (y + 1.0d0)
    if (y <= (-21000000000.0d0)) then
        tmp = x - ((x - 1.0d0) / y)
    else if (y <= 2.15d+14) then
        tmp = (t_0 - (2.0d0 * ((1.0d0 - x) * y))) / t_0
    else
        tmp = x - ((-1.0d0) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = 2.0 * (y + 1.0);
	double tmp;
	if (y <= -21000000000.0) {
		tmp = x - ((x - 1.0) / y);
	} else if (y <= 2.15e+14) {
		tmp = (t_0 - (2.0 * ((1.0 - x) * y))) / t_0;
	} else {
		tmp = x - (-1.0 / y);
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = 2.0 * (y + 1.0)
	tmp = 0
	if y <= -21000000000.0:
		tmp = x - ((x - 1.0) / y)
	elif y <= 2.15e+14:
		tmp = (t_0 - (2.0 * ((1.0 - x) * y))) / t_0
	else:
		tmp = x - (-1.0 / y)
	return tmp

Julia

function code(x, y)
	t_0 = Float64(2.0 * Float64(y + 1.0))
	tmp = 0.0
	if (y <= -21000000000.0)
		tmp = Float64(x - Float64(Float64(x - 1.0) / y));
	elseif (y <= 2.15e+14)
		tmp = Float64(Float64(t_0 - Float64(2.0 * Float64(Float64(1.0 - x) * y))) / t_0);
	else
		tmp = Float64(x - Float64(-1.0 / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = 2.0 * (y + 1.0);
	tmp = 0.0;
	if (y <= -21000000000.0)
		tmp = x - ((x - 1.0) / y);
	elseif (y <= 2.15e+14)
		tmp = (t_0 - (2.0 * ((1.0 - x) * y))) / t_0;
	else
		tmp = x - (-1.0 / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(2.0 * N[(y + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -21000000000.0], N[(x - N[(N[(x - 1.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.15e+14], N[(N[(t$95$0 - N[(2.0 * N[(N[(1.0 - x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(x - N[(-1.0 / y), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -2.1e10

   1. Initial program 40.5%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. times-frac N/A

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

      5. mul-1-neg N/A

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

      6. mul-1-neg N/A

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

      7. frac-2neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -2.1e10 < y < 2.15e14

   1. Initial program 99.9%

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

      1. lift--.f64 N/A

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

      2. metadata-eval N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. frac-sub N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lower-*.f64 N/A

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

      16. lift-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   if 2.15e14 < y

   1. Initial program 26.4%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. times-frac N/A

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

      5. mul-1-neg N/A

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

      6. mul-1-neg N/A

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

      7. frac-2neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 100.0%

      \[\leadsto x - \frac{-1}{y} \]
3. Recombined 3 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -21000000000:\\ \;\;\;\;x - \frac{x - 1}{y}\\ \mathbf{elif}\;y \leq 2.15 \cdot 10^{+14}:\\ \;\;\;\;\frac{2 \cdot \left(y + 1\right) - 2 \cdot \left(\left(1 - x\right) \cdot y\right)}{2 \cdot \left(y + 1\right)}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{-1}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 73.3% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- 1.0 (/ (* (- 1.0 x) y) (+ y 1.0)))))
   (if (<= t_0 0.01)
     x
     (if (<= t_0 2.0) (fma -1.0 y 1.0) (if (<= t_0 1e+148) (* y x) x)))))

C

double code(double x, double y) {
	double t_0 = 1.0 - (((1.0 - x) * y) / (y + 1.0));
	double tmp;
	if (t_0 <= 0.01) {
		tmp = x;
	} else if (t_0 <= 2.0) {
		tmp = fma(-1.0, y, 1.0);
	} else if (t_0 <= 1e+148) {
		tmp = y * x;
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(1.0 - Float64(Float64(Float64(1.0 - x) * y) / Float64(y + 1.0)))
	tmp = 0.0
	if (t_0 <= 0.01)
		tmp = x;
	elseif (t_0 <= 2.0)
		tmp = fma(-1.0, y, 1.0);
	elseif (t_0 <= 1e+148)
		tmp = Float64(y * x);
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 - N[(N[(N[(1.0 - x), $MachinePrecision] * y), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.01], x, If[LessEqual[t$95$0, 2.0], N[(-1.0 * y + 1.0), $MachinePrecision], If[LessEqual[t$95$0, 1e+148], N[(y * x), $MachinePrecision], x]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 #s(literal 1 binary64) (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64)))) < 0.0100000000000000002 or 1e148 < (-.f64 #s(literal 1 binary64) (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64))))

   1. Initial program 41.4%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 59.7%

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

   if 0.0100000000000000002 < (-.f64 #s(literal 1 binary64) (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64)))) < 2

   1. Initial program 100.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 97.9%

      \[\leadsto \color{blue}{1} \]

   6. Taylor expanded in y around 0

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

      1. metadata-eval N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      2. *-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      3. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      4. frac-sub N/A

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

      5. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      6. *-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      7. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      8. +-commutative N/A

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

      9. *-commutative N/A

         \[\leadsto \left(x - 1\right) \cdot y + 1 \]

      10. lower-fma.f64 N/A

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

      11. lift--.f64 100.0

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

   8. Applied rewrites 100.0%

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

   9. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(-1, y, 1\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 98.5%

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

   if 2 < (-.f64 #s(literal 1 binary64) (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64)))) < 1e148

   1. Initial program 99.9%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 6.6%

      \[\leadsto \color{blue}{1} \]

   6. Taylor expanded in y around 0

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

      1. metadata-eval N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      2. *-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      3. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      4. frac-sub N/A

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

      5. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      6. *-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      7. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      8. +-commutative N/A

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

      9. *-commutative N/A

         \[\leadsto \left(x - 1\right) \cdot y + 1 \]

      10. lower-fma.f64 N/A

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

      11. lift--.f64 74.0

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

   8. Applied rewrites 74.0%

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

   9. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{y} \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto y \cdot x \]

       2. lower-*.f64 71.3

          \[\leadsto y \cdot x \]

   11. Applied rewrites 71.3%

       \[\leadsto y \cdot \color{blue}{x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 77.0%

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

Alternative 3: 73.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(1 - x\right) \cdot y}{y + 1}\\ \mathbf{if}\;t\_0 \leq -1 \cdot 10^{+149}:\\ \;\;\;\;x\\ \mathbf{elif}\;t\_0 \leq -2000:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;t\_0 \leq 0.995:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* (- 1.0 x) y) (+ y 1.0))))
   (if (<= t_0 -1e+149)
     x
     (if (<= t_0 -2000.0) (* y x) (if (<= t_0 0.995) 1.0 x)))))

C

double code(double x, double y) {
	double t_0 = ((1.0 - x) * y) / (y + 1.0);
	double tmp;
	if (t_0 <= -1e+149) {
		tmp = x;
	} else if (t_0 <= -2000.0) {
		tmp = y * x;
	} else if (t_0 <= 0.995) {
		tmp = 1.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((1.0d0 - x) * y) / (y + 1.0d0)
    if (t_0 <= (-1d+149)) then
        tmp = x
    else if (t_0 <= (-2000.0d0)) then
        tmp = y * x
    else if (t_0 <= 0.995d0) then
        tmp = 1.0d0
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = ((1.0 - x) * y) / (y + 1.0);
	double tmp;
	if (t_0 <= -1e+149) {
		tmp = x;
	} else if (t_0 <= -2000.0) {
		tmp = y * x;
	} else if (t_0 <= 0.995) {
		tmp = 1.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((1.0 - x) * y) / (y + 1.0)
	tmp = 0
	if t_0 <= -1e+149:
		tmp = x
	elif t_0 <= -2000.0:
		tmp = y * x
	elif t_0 <= 0.995:
		tmp = 1.0
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(1.0 - x) * y) / Float64(y + 1.0))
	tmp = 0.0
	if (t_0 <= -1e+149)
		tmp = x;
	elseif (t_0 <= -2000.0)
		tmp = Float64(y * x);
	elseif (t_0 <= 0.995)
		tmp = 1.0;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = ((1.0 - x) * y) / (y + 1.0);
	tmp = 0.0;
	if (t_0 <= -1e+149)
		tmp = x;
	elseif (t_0 <= -2000.0)
		tmp = y * x;
	elseif (t_0 <= 0.995)
		tmp = 1.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(1.0 - x), $MachinePrecision] * y), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -1e+149], x, If[LessEqual[t$95$0, -2000.0], N[(y * x), $MachinePrecision], If[LessEqual[t$95$0, 0.995], 1.0, x]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64))) < -1.00000000000000005e149 or 0.994999999999999996 < (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64)))

   1. Initial program 41.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 60.2%

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

   if -1.00000000000000005e149 < (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64))) < -2e3

   1. Initial program 99.9%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 6.6%

      \[\leadsto \color{blue}{1} \]

   6. Taylor expanded in y around 0

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

      1. metadata-eval N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      2. *-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      3. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      4. frac-sub N/A

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

      5. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      6. *-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      7. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      8. +-commutative N/A

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

      9. *-commutative N/A

         \[\leadsto \left(x - 1\right) \cdot y + 1 \]

      10. lower-fma.f64 N/A

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

      11. lift--.f64 74.0

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

   8. Applied rewrites 74.0%

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

   9. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{y} \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto y \cdot x \]

       2. lower-*.f64 71.3

          \[\leadsto y \cdot x \]

   11. Applied rewrites 71.3%

       \[\leadsto y \cdot \color{blue}{x} \]

   if -2e3 < (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64))) < 0.994999999999999996

   1. Initial program 99.9%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 97.1%

      \[\leadsto \color{blue}{1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 76.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(1 - x\right) \cdot y}{y + 1} \leq -1 \cdot 10^{+149}:\\ \;\;\;\;x\\ \mathbf{elif}\;\frac{\left(1 - x\right) \cdot y}{y + 1} \leq -2000:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;\frac{\left(1 - x\right) \cdot y}{y + 1} \leq 0.995:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -125000000:\\ \;\;\;\;x - \frac{x - 1}{y}\\ \mathbf{elif}\;y \leq 150000000000:\\ \;\;\;\;1 - \frac{\left(1 - x\right) \cdot y}{y + 1}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{-1}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -125000000.0)
   (- x (/ (- x 1.0) y))
   (if (<= y 150000000000.0)
     (- 1.0 (/ (* (- 1.0 x) y) (+ y 1.0)))
     (- x (/ -1.0 y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -125000000.0) {
		tmp = x - ((x - 1.0) / y);
	} else if (y <= 150000000000.0) {
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0));
	} else {
		tmp = x - (-1.0 / y);
	}
	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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-125000000.0d0)) then
        tmp = x - ((x - 1.0d0) / y)
    else if (y <= 150000000000.0d0) then
        tmp = 1.0d0 - (((1.0d0 - x) * y) / (y + 1.0d0))
    else
        tmp = x - ((-1.0d0) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -125000000.0) {
		tmp = x - ((x - 1.0) / y);
	} else if (y <= 150000000000.0) {
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0));
	} else {
		tmp = x - (-1.0 / y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -125000000.0:
		tmp = x - ((x - 1.0) / y)
	elif y <= 150000000000.0:
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0))
	else:
		tmp = x - (-1.0 / y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -125000000.0)
		tmp = Float64(x - Float64(Float64(x - 1.0) / y));
	elseif (y <= 150000000000.0)
		tmp = Float64(1.0 - Float64(Float64(Float64(1.0 - x) * y) / Float64(y + 1.0)));
	else
		tmp = Float64(x - Float64(-1.0 / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -125000000.0)
		tmp = x - ((x - 1.0) / y);
	elseif (y <= 150000000000.0)
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0));
	else
		tmp = x - (-1.0 / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -125000000.0], N[(x - N[(N[(x - 1.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 150000000000.0], N[(1.0 - N[(N[(N[(1.0 - x), $MachinePrecision] * y), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(-1.0 / y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.25e8

   1. Initial program 40.5%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. times-frac N/A

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

      5. mul-1-neg N/A

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

      6. mul-1-neg N/A

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

      7. frac-2neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -1.25e8 < y < 1.5e11

   1. Initial program 99.9%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   if 1.5e11 < y

   1. Initial program 26.4%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. times-frac N/A

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

      5. mul-1-neg N/A

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

      6. mul-1-neg N/A

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

      7. frac-2neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 100.0%

      \[\leadsto x - \frac{-1}{y} \]
3. Recombined 3 regimes into one program.

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -125000000:\\ \;\;\;\;x - \frac{x - 1}{y}\\ \mathbf{elif}\;y \leq 150000000000:\\ \;\;\;\;1 - \frac{\left(1 - x\right) \cdot y}{y + 1}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{-1}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -310:\\ \;\;\;\;x - \frac{x - 1}{y}\\ \mathbf{elif}\;y \leq 3600000:\\ \;\;\;\;1 - \frac{\left(-x\right) \cdot y}{y + 1}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{-1}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -310.0)
   (- x (/ (- x 1.0) y))
   (if (<= y 3600000.0) (- 1.0 (/ (* (- x) y) (+ y 1.0))) (- x (/ -1.0 y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -310.0) {
		tmp = x - ((x - 1.0) / y);
	} else if (y <= 3600000.0) {
		tmp = 1.0 - ((-x * y) / (y + 1.0));
	} else {
		tmp = x - (-1.0 / y);
	}
	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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-310.0d0)) then
        tmp = x - ((x - 1.0d0) / y)
    else if (y <= 3600000.0d0) then
        tmp = 1.0d0 - ((-x * y) / (y + 1.0d0))
    else
        tmp = x - ((-1.0d0) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -310.0) {
		tmp = x - ((x - 1.0) / y);
	} else if (y <= 3600000.0) {
		tmp = 1.0 - ((-x * y) / (y + 1.0));
	} else {
		tmp = x - (-1.0 / y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -310.0:
		tmp = x - ((x - 1.0) / y)
	elif y <= 3600000.0:
		tmp = 1.0 - ((-x * y) / (y + 1.0))
	else:
		tmp = x - (-1.0 / y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -310.0)
		tmp = Float64(x - Float64(Float64(x - 1.0) / y));
	elseif (y <= 3600000.0)
		tmp = Float64(1.0 - Float64(Float64(Float64(-x) * y) / Float64(y + 1.0)));
	else
		tmp = Float64(x - Float64(-1.0 / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -310.0)
		tmp = x - ((x - 1.0) / y);
	elseif (y <= 3600000.0)
		tmp = 1.0 - ((-x * y) / (y + 1.0));
	else
		tmp = x - (-1.0 / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -310.0], N[(x - N[(N[(x - 1.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3600000.0], N[(1.0 - N[(N[((-x) * y), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(-1.0 / y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -310

   1. Initial program 40.5%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. times-frac N/A

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

      5. mul-1-neg N/A

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

      6. mul-1-neg N/A

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

      7. frac-2neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -310 < y < 3.6e6

   1. Initial program 99.9%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 99.0

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

   5. Applied rewrites 99.0%

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

   if 3.6e6 < y

   1. Initial program 26.4%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. times-frac N/A

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

      5. mul-1-neg N/A

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

      6. mul-1-neg N/A

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

      7. frac-2neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 100.0%

      \[\leadsto x - \frac{-1}{y} \]
3. Recombined 3 regimes into one program.

4. Final simplification 99.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -310:\\ \;\;\;\;x - \frac{x - 1}{y}\\ \mathbf{elif}\;y \leq 3600000:\\ \;\;\;\;1 - \frac{\left(-x\right) \cdot y}{y + 1}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{-1}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 98.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;x - \frac{x - 1}{y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-x, y, x\right) - 1, y, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0)))
   (- x (/ (- x 1.0) y))
   (fma (- (fma (- x) y x) 1.0) y 1.0)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = x - ((x - 1.0) / y);
	} else {
		tmp = fma((fma(-x, y, x) - 1.0), y, 1.0);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = Float64(x - Float64(Float64(x - 1.0) / y));
	else
		tmp = fma(Float64(fma(Float64(-x), y, x) - 1.0), y, 1.0);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(x - N[(N[(x - 1.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(N[((-x) * y + x), $MachinePrecision] - 1.0), $MachinePrecision] * y + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 35.2%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. times-frac N/A

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

      5. mul-1-neg N/A

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

      6. mul-1-neg N/A

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

      7. frac-2neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower--.f64 98.5

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

   5. Applied rewrites 98.5%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(\left(x + y \cdot \left(1 - x\right)\right) - 1\right) \cdot y + 1 \]

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\left(x + y \cdot \left(1 - x\right)\right) - 1, y, 1\right) \]

      5. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(y \cdot \left(1 - x\right) + x\right) - 1, y, 1\right) \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(\left(1 - x\right) \cdot y + x\right) - 1, y, 1\right) \]

      7. lower-fma.f64 N/A

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

      8. lift--.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in x around inf

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-1 \cdot x, y, x\right) - 1, y, 1\right) \]
   7. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. lower-neg.f64 99.9

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

   8. Applied rewrites 99.9%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-x, y, x\right) - 1, y, 1\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;x - \frac{x - 1}{y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-x, y, x\right) - 1, y, 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 98.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;x - \frac{x - 1}{y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x - 1, y, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0)))
   (- x (/ (- x 1.0) y))
   (fma (- x 1.0) y 1.0)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = x - ((x - 1.0) / y);
	} else {
		tmp = fma((x - 1.0), y, 1.0);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = Float64(x - Float64(Float64(x - 1.0) / y));
	else
		tmp = fma(Float64(x - 1.0), y, 1.0);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(x - N[(N[(x - 1.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(x - 1.0), $MachinePrecision] * y + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 35.2%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. times-frac N/A

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

      5. mul-1-neg N/A

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

      6. mul-1-neg N/A

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

      7. frac-2neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower--.f64 98.5

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

   5. Applied rewrites 98.5%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(x - 1\right) \cdot y + 1 \]

      3. lower-fma.f64 N/A

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

      4. lower--.f64 99.1

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

   5. Applied rewrites 99.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x - 1, y, 1\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;x - \frac{x - 1}{y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x - 1, y, 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 98.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 0.85\right):\\ \;\;\;\;x - \frac{-1}{y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x - 1, y, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 0.85)))
   (- x (/ -1.0 y))
   (fma (- x 1.0) y 1.0)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 0.85)) {
		tmp = x - (-1.0 / y);
	} else {
		tmp = fma((x - 1.0), y, 1.0);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 0.85))
		tmp = Float64(x - Float64(-1.0 / y));
	else
		tmp = fma(Float64(x - 1.0), y, 1.0);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 0.85]], $MachinePrecision]], N[(x - N[(-1.0 / y), $MachinePrecision]), $MachinePrecision], N[(N[(x - 1.0), $MachinePrecision] * y + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.849999999999999978 < y

   1. Initial program 35.2%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. times-frac N/A

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

      5. mul-1-neg N/A

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

      6. mul-1-neg N/A

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

      7. frac-2neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower--.f64 98.5

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

   5. Applied rewrites 98.5%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 97.6%

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

   if -1 < y < 0.849999999999999978

   1. Initial program 100.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(x - 1\right) \cdot y + 1 \]

      3. lower-fma.f64 N/A

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

      4. lower--.f64 99.1

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

   5. Applied rewrites 99.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x - 1, y, 1\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 0.85\right):\\ \;\;\;\;x - \frac{-1}{y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x - 1, y, 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 86.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;\mathsf{fma}\left(x - 1, y, 1\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.0) x (if (<= y 1.0) (fma (- x 1.0) y 1.0) x)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = x;
	} else if (y <= 1.0) {
		tmp = fma((x - 1.0), y, 1.0);
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = x;
	elseif (y <= 1.0)
		tmp = fma(Float64(x - 1.0), y, 1.0);
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.0], x, If[LessEqual[y, 1.0], N[(N[(x - 1.0), $MachinePrecision] * y + 1.0), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 35.2%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 69.8%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(x - 1\right) \cdot y + 1 \]

      3. lower-fma.f64 N/A

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

      4. lower--.f64 99.1

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

   5. Applied rewrites 99.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x - 1, y, 1\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 86.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;\mathsf{fma}\left(x - 1, y, 1\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 85.7% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 160:\\ \;\;\;\;\mathsf{fma}\left(x, y, 1\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.0) x (if (<= y 160.0) (fma x y 1.0) x)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = x;
	} else if (y <= 160.0) {
		tmp = fma(x, y, 1.0);
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = x;
	elseif (y <= 160.0)
		tmp = fma(x, y, 1.0);
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.0], x, If[LessEqual[y, 160.0], N[(x * y + 1.0), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 160 < y

   1. Initial program 34.1%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 70.8%

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

   if -1 < y < 160

   1. Initial program 99.9%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 73.5%

      \[\leadsto \color{blue}{1} \]

   6. Taylor expanded in y around 0

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

      1. metadata-eval N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      2. *-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      3. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      4. frac-sub N/A

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

      5. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      6. *-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      7. +-commutative N/A

         \[\leadsto 1 + y \cdot \left(x - 1\right) \]

      8. +-commutative N/A

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

      9. *-commutative N/A

         \[\leadsto \left(x - 1\right) \cdot y + 1 \]

      10. lower-fma.f64 N/A

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

      11. lift--.f64 97.9

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

   8. Applied rewrites 97.9%

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

   9. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(-1, y, 1\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 73.8%

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

   12. Taylor expanded in x around inf

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

   14. Applied rewrites 97.6%

       \[\leadsto \mathsf{fma}\left(x, y, 1\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 85.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 160:\\ \;\;\;\;\mathsf{fma}\left(x, y, 1\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 73.8% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 6.4:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y -1.0) x (if (<= y 6.4) 1.0 x)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = x;
	} else if (y <= 6.4) {
		tmp = 1.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-1.0d0)) then
        tmp = x
    else if (y <= 6.4d0) then
        tmp = 1.0d0
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = x;
	} else if (y <= 6.4) {
		tmp = 1.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.0:
		tmp = x
	elif y <= 6.4:
		tmp = 1.0
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = x;
	elseif (y <= 6.4)
		tmp = 1.0;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.0)
		tmp = x;
	elseif (y <= 6.4)
		tmp = 1.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.0], x, If[LessEqual[y, 6.4], 1.0, x]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 6.4000000000000004 < y

   1. Initial program 35.2%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 69.8%

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

   if -1 < y < 6.4000000000000004

   1. Initial program 100.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 74.4%

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

4. Final simplification 72.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 6.4:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 38.7% accurate, 26.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 1.0)

C

double code(double x, double y) {
	return 1.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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0
end function

Java

public static double code(double x, double y) {
	return 1.0;
}

Python

def code(x, y):
	return 1.0

Julia

function code(x, y)
	return 1.0
end

MATLAB

function tmp = code(x, y)
	tmp = 1.0;
end

Wolfram

code[x_, y_] := 1.0

Derivation

1. Initial program 71.4%

   \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

5. Applied rewrites 43.1%

   \[\leadsto \color{blue}{1} \]

6. Final simplification 43.1%

   \[\leadsto 1 \]
7. Add Preprocessing

Developer Target 1: 99.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{y} - \left(\frac{x}{y} - x\right)\\ \mathbf{if}\;y < -3693.8482788297247:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y < 6799310503.41891:\\ \;\;\;\;1 - \frac{\left(1 - x\right) \cdot y}{y + 1}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- (/ 1.0 y) (- (/ x y) x))))
   (if (< y -3693.8482788297247)
     t_0
     (if (< y 6799310503.41891) (- 1.0 (/ (* (- 1.0 x) y) (+ y 1.0))) t_0))))

C

double code(double x, double y) {
	double t_0 = (1.0 / y) - ((x / y) - x);
	double tmp;
	if (y < -3693.8482788297247) {
		tmp = t_0;
	} else if (y < 6799310503.41891) {
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0));
	} else {
		tmp = t_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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (1.0d0 / y) - ((x / y) - x)
    if (y < (-3693.8482788297247d0)) then
        tmp = t_0
    else if (y < 6799310503.41891d0) then
        tmp = 1.0d0 - (((1.0d0 - x) * y) / (y + 1.0d0))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (1.0 / y) - ((x / y) - x);
	double tmp;
	if (y < -3693.8482788297247) {
		tmp = t_0;
	} else if (y < 6799310503.41891) {
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (1.0 / y) - ((x / y) - x)
	tmp = 0
	if y < -3693.8482788297247:
		tmp = t_0
	elif y < 6799310503.41891:
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(1.0 / y) - Float64(Float64(x / y) - x))
	tmp = 0.0
	if (y < -3693.8482788297247)
		tmp = t_0;
	elseif (y < 6799310503.41891)
		tmp = Float64(1.0 - Float64(Float64(Float64(1.0 - x) * y) / Float64(y + 1.0)));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (1.0 / y) - ((x / y) - x);
	tmp = 0.0;
	if (y < -3693.8482788297247)
		tmp = t_0;
	elseif (y < 6799310503.41891)
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(1.0 / y), $MachinePrecision] - N[(N[(x / y), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]}, If[Less[y, -3693.8482788297247], t$95$0, If[Less[y, 6799310503.41891], N[(1.0 - N[(N[(N[(1.0 - x), $MachinePrecision] * y), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Reproduce

herbie shell --seed 2025072 
(FPCore (x y)
  :name "Diagrams.Trail:splitAtParam  from diagrams-lib-1.3.0.3, D"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< y -36938482788297247/10000000000000) (- (/ 1 y) (- (/ x y) x)) (if (< y 679931050341891/100000) (- 1 (/ (* (- 1 x) y) (+ y 1))) (- (/ 1 y) (- (/ x y) x)))))

  (- 1.0 (/ (* (- 1.0 x) y) (+ y 1.0))))