Codec.Picture.Types:toneMapping from JuicyPixels-3.2.6.1

Percentage Accurate: 88.6% → 99.9%

Time: 6.9s

Alternatives: 12

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

double code(double x, double y) {
	return (x * ((x / y) + 1.0)) / (x + 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 = (x * ((x / y) + 1.0d0)) / (x + 1.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 88.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	return (x * ((x / y) + 1.0)) / (x + 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 = (x * ((x / y) + 1.0d0)) / (x + 1.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 = (x / (1.0d0 + x)) * (1.0d0 + (x / y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 87.1%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. associate-/l* N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 N/A

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

   7. lower-/.f64 99.9

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

   8. lift-+.f64 N/A

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

   9. +-commutative N/A

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

   10. lower-+.f64 99.9

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

   11. lift-+.f64 N/A

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

   12. +-commutative N/A

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

   13. lower-+.f64 99.9

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

4. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\frac{x}{1 + x} \cdot \left(1 + \frac{x}{y}\right)} \]
5. Add Preprocessing

Alternative 2: 98.3% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1.19999999999999996 < x

   1. Initial program 76.5%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 76.5

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

   4. Applied rewrites 76.5%

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

   5. Taylor expanded in x around -inf

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

   7. Applied rewrites 98.5%

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

   9. Applied rewrites 98.5%

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

   if -1 < x < 1.19999999999999996

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 97.4

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

   5. Applied rewrites 97.4%

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

4. Final simplification 98.0%

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

Alternative 3: 98.3% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- (pow y -1.0) 1.0)))
   (if (<= x -1.0)
     (- (/ x y) t_0)
     (if (<= x 1.2) (* (fma t_0 x 1.0) x) (+ (/ (- x 1.0) y) 1.0)))))

C

double code(double x, double y) {
	double t_0 = pow(y, -1.0) - 1.0;
	double tmp;
	if (x <= -1.0) {
		tmp = (x / y) - t_0;
	} else if (x <= 1.2) {
		tmp = fma(t_0, x, 1.0) * x;
	} else {
		tmp = ((x - 1.0) / y) + 1.0;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -1

   1. Initial program 75.6%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 75.6

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

   4. Applied rewrites 75.6%

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

   5. Taylor expanded in x around -inf

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

   7. Applied rewrites 98.6%

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

   if -1 < x < 1.19999999999999996

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 97.4

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

   5. Applied rewrites 97.4%

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

   if 1.19999999999999996 < x

   1. Initial program 77.5%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 77.5

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

   4. Applied rewrites 77.5%

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

   5. Taylor expanded in x around -inf

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

   7. Applied rewrites 98.4%

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

   9. Applied rewrites 98.4%

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

4. Final simplification 98.0%

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

Alternative 4: 99.8% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* x (+ (/ x y) 1.0)) (- x -1.0))) (t_1 (/ (- x 1.0) y)))
   (if (<= t_0 (- INFINITY))
     t_1
     (if (<= t_0 5e+263) (/ (fma (/ x y) x x) (- x -1.0)) (+ t_1 1.0)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 46.5%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 46.5

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

   4. Applied rewrites 46.5%

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

   5. Taylor expanded in x around -inf

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

   7. Applied rewrites 100.0%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 100.0%

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

   if -inf.0 < (/.f64 (*.f64 x (+.f64 (/.f64 x y) #s(literal 1 binary64))) (+.f64 x #s(literal 1 binary64))) < 5.00000000000000022e263

   1. Initial program 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 99.9

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

   4. Applied rewrites 99.9%

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

   if 5.00000000000000022e263 < (/.f64 (*.f64 x (+.f64 (/.f64 x y) #s(literal 1 binary64))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 54.2%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 54.2

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

   4. Applied rewrites 54.2%

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

   5. Taylor expanded in x around -inf

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

   7. Applied rewrites 99.4%

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

   9. Applied rewrites 99.4%

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

4. Final simplification 99.8%

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

Alternative 5: 85.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x \cdot \left(\frac{x}{y} + 1\right)}{x - -1}\\ \mathbf{if}\;t\_0 \leq -1000000 \lor \neg \left(t\_0 \leq 2\right):\\ \;\;\;\;\frac{x - 1}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x - -1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* x (+ (/ x y) 1.0)) (- x -1.0))))
   (if (or (<= t_0 -1000000.0) (not (<= t_0 2.0)))
     (/ (- x 1.0) y)
     (/ x (- x -1.0)))))

C

double code(double x, double y) {
	double t_0 = (x * ((x / y) + 1.0)) / (x - -1.0);
	double tmp;
	if ((t_0 <= -1000000.0) || !(t_0 <= 2.0)) {
		tmp = (x - 1.0) / y;
	} else {
		tmp = x / (x - -1.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 = (x * ((x / y) + 1.0d0)) / (x - (-1.0d0))
    if ((t_0 <= (-1000000.0d0)) .or. (.not. (t_0 <= 2.0d0))) then
        tmp = (x - 1.0d0) / y
    else
        tmp = x / (x - (-1.0d0))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	t_0 = (x * ((x / y) + 1.0)) / (x - -1.0)
	tmp = 0
	if (t_0 <= -1000000.0) or not (t_0 <= 2.0):
		tmp = (x - 1.0) / y
	else:
		tmp = x / (x - -1.0)
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(x * Float64(Float64(x / y) + 1.0)) / Float64(x - -1.0))
	tmp = 0.0
	if ((t_0 <= -1000000.0) || !(t_0 <= 2.0))
		tmp = Float64(Float64(x - 1.0) / y);
	else
		tmp = Float64(x / Float64(x - -1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (x * ((x / y) + 1.0)) / (x - -1.0);
	tmp = 0.0;
	if ((t_0 <= -1000000.0) || ~((t_0 <= 2.0)))
		tmp = (x - 1.0) / y;
	else
		tmp = x / (x - -1.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 72.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 72.9

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

   4. Applied rewrites 72.9%

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

   5. Taylor expanded in x around -inf

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

   7. Applied rewrites 86.3%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 84.9%

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

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

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. rgt-mult-inverse N/A

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

      3. *-rgt-identity N/A

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

      4. distribute-lft-in N/A

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

      5. +-commutative N/A

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

      6. distribute-lft-in N/A

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

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

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

      8. *-rgt-identity N/A

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

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

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

      10. rgt-mult-inverse N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 90.7

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

   5. Applied rewrites 90.7%

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

4. Final simplification 87.9%

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

Alternative 6: 55.9% accurate, 0.6× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (((x * ((x / y) + 1.0)) / (x - -1.0)) <= -1000000.0) {
		tmp = -x * x;
	} else {
		tmp = x / (x - -1.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) :: tmp
    if (((x * ((x / y) + 1.0d0)) / (x - (-1.0d0))) <= (-1000000.0d0)) then
        tmp = -x * x
    else
        tmp = x / (x - (-1.0d0))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 71.6%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 21.9

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

   5. Applied rewrites 21.9%

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

   6. Taylor expanded in y around inf

      \[\leadsto \left(1 + -1 \cdot x\right) \cdot x \]
   7. Step-by-step derivation

   8. Applied rewrites 25.7%

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

   9. Taylor expanded in x around inf

      \[\leadsto \left(-1 \cdot x\right) \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 25.9%

       \[\leadsto \left(-x\right) \cdot x \]

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

   1. Initial program 91.1%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. rgt-mult-inverse N/A

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

      3. *-rgt-identity N/A

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

      4. distribute-lft-in N/A

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

      5. +-commutative N/A

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

      6. distribute-lft-in N/A

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

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

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

      8. *-rgt-identity N/A

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

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

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

      10. rgt-mult-inverse N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 61.6

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

   5. Applied rewrites 61.6%

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

4. Final simplification 54.2%

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

Alternative 7: 43.5% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (((x * ((x / y) + 1.0)) / (x - -1.0)) <= -1000000.0) {
		tmp = -x * x;
	} else {
		tmp = 1.0 * 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 (((x * ((x / y) + 1.0d0)) / (x - (-1.0d0))) <= (-1000000.0d0)) then
        tmp = -x * x
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 71.6%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 21.9

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

   5. Applied rewrites 21.9%

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

   6. Taylor expanded in y around inf

      \[\leadsto \left(1 + -1 \cdot x\right) \cdot x \]
   7. Step-by-step derivation

   8. Applied rewrites 25.7%

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

   9. Taylor expanded in x around inf

      \[\leadsto \left(-1 \cdot x\right) \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 25.9%

       \[\leadsto \left(-x\right) \cdot x \]

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

   1. Initial program 91.1%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 58.1

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

   5. Applied rewrites 58.1%

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

   6. Taylor expanded in y around inf

      \[\leadsto \left(1 + -1 \cdot x\right) \cdot x \]
   7. Step-by-step derivation

   8. Applied rewrites 44.2%

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

   9. Taylor expanded in x around 0

      \[\leadsto 1 \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 45.0%

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

4. Final simplification 41.0%

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

Alternative 8: 91.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x - 1}{y} + 1\\ t_1 := \left(y + x\right) \cdot \frac{x}{y}\\ \mathbf{if}\;x \leq -1:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -1.15 \cdot 10^{-114}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 2.3 \cdot 10^{-168}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;x \leq 1.25:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (/ (- x 1.0) y) 1.0)) (t_1 (* (+ y x) (/ x y))))
   (if (<= x -1.0)
     t_0
     (if (<= x -1.15e-114)
       t_1
       (if (<= x 2.3e-168) (* 1.0 x) (if (<= x 1.25) t_1 t_0))))))

C

double code(double x, double y) {
	double t_0 = ((x - 1.0) / y) + 1.0;
	double t_1 = (y + x) * (x / y);
	double tmp;
	if (x <= -1.0) {
		tmp = t_0;
	} else if (x <= -1.15e-114) {
		tmp = t_1;
	} else if (x <= 2.3e-168) {
		tmp = 1.0 * x;
	} else if (x <= 1.25) {
		tmp = t_1;
	} 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) :: t_1
    real(8) :: tmp
    t_0 = ((x - 1.0d0) / y) + 1.0d0
    t_1 = (y + x) * (x / y)
    if (x <= (-1.0d0)) then
        tmp = t_0
    else if (x <= (-1.15d-114)) then
        tmp = t_1
    else if (x <= 2.3d-168) then
        tmp = 1.0d0 * x
    else if (x <= 1.25d0) then
        tmp = t_1
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = ((x - 1.0) / y) + 1.0;
	double t_1 = (y + x) * (x / y);
	double tmp;
	if (x <= -1.0) {
		tmp = t_0;
	} else if (x <= -1.15e-114) {
		tmp = t_1;
	} else if (x <= 2.3e-168) {
		tmp = 1.0 * x;
	} else if (x <= 1.25) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((x - 1.0) / y) + 1.0
	t_1 = (y + x) * (x / y)
	tmp = 0
	if x <= -1.0:
		tmp = t_0
	elif x <= -1.15e-114:
		tmp = t_1
	elif x <= 2.3e-168:
		tmp = 1.0 * x
	elif x <= 1.25:
		tmp = t_1
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(x - 1.0) / y) + 1.0)
	t_1 = Float64(Float64(y + x) * Float64(x / y))
	tmp = 0.0
	if (x <= -1.0)
		tmp = t_0;
	elseif (x <= -1.15e-114)
		tmp = t_1;
	elseif (x <= 2.3e-168)
		tmp = Float64(1.0 * x);
	elseif (x <= 1.25)
		tmp = t_1;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = ((x - 1.0) / y) + 1.0;
	t_1 = (y + x) * (x / y);
	tmp = 0.0;
	if (x <= -1.0)
		tmp = t_0;
	elseif (x <= -1.15e-114)
		tmp = t_1;
	elseif (x <= 2.3e-168)
		tmp = 1.0 * x;
	elseif (x <= 1.25)
		tmp = t_1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(x - 1.0), $MachinePrecision] / y), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(y + x), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.0], t$95$0, If[LessEqual[x, -1.15e-114], t$95$1, If[LessEqual[x, 2.3e-168], N[(1.0 * x), $MachinePrecision], If[LessEqual[x, 1.25], t$95$1, t$95$0]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1 or 1.25 < x

   1. Initial program 76.5%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 76.5

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

   4. Applied rewrites 76.5%

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

   5. Taylor expanded in x around -inf

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

   7. Applied rewrites 98.5%

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

   9. Applied rewrites 98.5%

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

   if -1 < x < -1.15e-114 or 2.29999999999999986e-168 < x < 1.25

   1. Initial program 99.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 99.7

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-+.f64 99.7

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 99.7

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

   4. Applied rewrites 99.7%

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

   6. Applied rewrites 97.6%

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

   7. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{\frac{x \cdot y}{1 + x} + \frac{{x}^{2}}{1 + x}}{y}} \]

   9. Applied rewrites 92.4%

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

   10. Taylor expanded in x around 0

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

   12. Applied rewrites 86.4%

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

   if -1.15e-114 < x < 2.29999999999999986e-168

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in y around inf

      \[\leadsto \left(1 + -1 \cdot x\right) \cdot x \]
   7. Step-by-step derivation

   8. Applied rewrites 93.9%

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

   9. Taylor expanded in x around 0

      \[\leadsto 1 \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 93.9%

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

4. Final simplification 94.4%

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

Alternative 9: 98.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1.19999999999999996 < x

   1. Initial program 76.5%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 76.5

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

   4. Applied rewrites 76.5%

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

   5. Taylor expanded in x around -inf

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

   7. Applied rewrites 98.5%

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

   9. Applied rewrites 98.5%

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

   if -1 < x < 1.19999999999999996

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 97.4

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

   5. Applied rewrites 97.4%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 97.4%

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

4. Final simplification 98.0%

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

Alternative 10: 86.5% accurate, 1.1× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((x <= -21.0) || !(x <= 1.15)) {
		tmp = ((x - 1.0) / y) + 1.0;
	} else {
		tmp = x / (x - -1.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) :: tmp
    if ((x <= (-21.0d0)) .or. (.not. (x <= 1.15d0))) then
        tmp = ((x - 1.0d0) / y) + 1.0d0
    else
        tmp = x / (x - (-1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -21.0) || !(x <= 1.15)) {
		tmp = ((x - 1.0) / y) + 1.0;
	} else {
		tmp = x / (x - -1.0);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -21.0) or not (x <= 1.15):
		tmp = ((x - 1.0) / y) + 1.0
	else:
		tmp = x / (x - -1.0)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -21.0) || ~((x <= 1.15)))
		tmp = ((x - 1.0) / y) + 1.0;
	else
		tmp = x / (x - -1.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -21 or 1.1499999999999999 < x

   1. Initial program 76.6%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 76.6

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

   4. Applied rewrites 76.6%

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

   5. Taylor expanded in x around -inf

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

   7. Applied rewrites 97.9%

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

   9. Applied rewrites 97.9%

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

   if -21 < x < 1.1499999999999999

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. rgt-mult-inverse N/A

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

      3. *-rgt-identity N/A

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

      4. distribute-lft-in N/A

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

      5. +-commutative N/A

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

      6. distribute-lft-in N/A

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

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

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

      8. *-rgt-identity N/A

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

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

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

      10. rgt-mult-inverse N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 78.1

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

   5. Applied rewrites 78.1%

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

4. Final simplification 89.0%

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

Alternative 11: 42.8% accurate, 3.8× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	return (1.0 - x) * x;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 87.1%

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

3. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

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

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

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

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

   5. +-commutative N/A

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

   6. remove-double-neg N/A

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

   7. *-commutative N/A

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

   8. lower-fma.f64 N/A

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

   9. lower--.f64 N/A

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

   10. lower-/.f64 50.6

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

5. Applied rewrites 50.6%

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

6. Taylor expanded in y around inf

   \[\leadsto \left(1 + -1 \cdot x\right) \cdot x \]
7. Step-by-step derivation

8. Applied rewrites 40.3%

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

9. Final simplification 40.3%

   \[\leadsto \left(1 - x\right) \cdot x \]
10. Add Preprocessing

Alternative 12: 38.6% accurate, 5.7× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (* 1.0 x))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0 * x
end function

Java

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

Python

def code(x, y):
	return 1.0 * x

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 87.1%

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

3. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

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

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

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

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

   5. +-commutative N/A

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

   6. remove-double-neg N/A

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

   7. *-commutative N/A

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

   8. lower-fma.f64 N/A

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

   9. lower--.f64 N/A

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

   10. lower-/.f64 50.6

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

5. Applied rewrites 50.6%

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

6. Taylor expanded in y around inf

   \[\leadsto \left(1 + -1 \cdot x\right) \cdot x \]
7. Step-by-step derivation

8. Applied rewrites 40.3%

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

9. Taylor expanded in x around 0

   \[\leadsto 1 \cdot x \]
10. Step-by-step derivation

11. Applied rewrites 36.5%

    \[\leadsto 1 \cdot x \]

12. Final simplification 36.5%

    \[\leadsto 1 \cdot x \]
13. Add Preprocessing

Developer Target 1: 99.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \frac{x}{1} \cdot \frac{\frac{x}{y} + 1}{x + 1} \end{array} \]

FPCore

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

C

double code(double x, double y) {
	return (x / 1.0) * (((x / y) + 1.0) / (x + 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 = (x / 1.0d0) * (((x / y) + 1.0d0) / (x + 1.0d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024364 
(FPCore (x y)
  :name "Codec.Picture.Types:toneMapping from JuicyPixels-3.2.6.1"
  :precision binary64

  :alt
  (! :herbie-platform default (* (/ x 1) (/ (+ (/ x y) 1) (+ x 1))))

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