Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisLine from plot-0.2.3.4, B

Percentage Accurate: 98.3% → 98.3%

Time: 6.1s

Alternatives: 13

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ x + y \cdot \frac{z - t}{a - t} \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + y \cdot \frac{z - t}{a - t} \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.3% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.9%

   \[x + y \cdot \frac{z - t}{a - t} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 98.9

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

4. Applied rewrites 98.9%

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

Alternative 2: 86.2% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -0.5)
     (fma (/ (- t z) t) y x)
     (if (<= t_1 4e-15)
       (fma (- z t) (/ y a) x)
       (if (<= t_1 5e+99) (fma (- 1.0 (/ z t)) y x) (* z (/ y (- a t))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = fma(((t - z) / t), y, x);
	} else if (t_1 <= 4e-15) {
		tmp = fma((z - t), (y / a), x);
	} else if (t_1 <= 5e+99) {
		tmp = fma((1.0 - (z / t)), y, x);
	} else {
		tmp = z * (y / (a - t));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= -0.5)
		tmp = fma(Float64(Float64(t - z) / t), y, x);
	elseif (t_1 <= 4e-15)
		tmp = fma(Float64(z - t), Float64(y / a), x);
	elseif (t_1 <= 5e+99)
		tmp = fma(Float64(1.0 - Float64(z / t)), y, x);
	else
		tmp = Float64(z * Float64(y / Float64(a - t)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[(N[(t - z), $MachinePrecision] / t), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 4e-15], N[(N[(z - t), $MachinePrecision] * N[(y / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 5e+99], N[(N[(1.0 - N[(z / t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision], N[(z * N[(y / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -0.5

   1. Initial program 97.6%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 97.6

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

   4. Applied rewrites 97.6%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 71.1%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 71.1%

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

   if -0.5 < (/.f64 (-.f64 z t) (-.f64 a t)) < 4.0000000000000003e-15

   1. Initial program 99.1%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 96.6%

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

   if 4.0000000000000003e-15 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.00000000000000008e99

   1. Initial program 99.9%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 97.7%

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

   if 5.00000000000000008e99 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 95.3%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 95.3

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

   4. Applied rewrites 95.3%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 86.4%

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

   9. Applied rewrites 86.5%

      \[\leadsto z \cdot \color{blue}{\frac{y}{a - t}} \]
3. Recombined 4 regimes into one program.

4. Final simplification 92.1%

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

Alternative 3: 86.2% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (fma (- 1.0 (/ z t)) y x)))
   (if (<= t_1 -0.5)
     t_2
     (if (<= t_1 4e-15)
       (fma (- z t) (/ y a) x)
       (if (<= t_1 5e+99) t_2 (* z (/ y (- a t))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = fma((1.0 - (z / t)), y, x);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = t_2;
	} else if (t_1 <= 4e-15) {
		tmp = fma((z - t), (y / a), x);
	} else if (t_1 <= 5e+99) {
		tmp = t_2;
	} else {
		tmp = z * (y / (a - t));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = fma(Float64(1.0 - Float64(z / t)), y, x)
	tmp = 0.0
	if (t_1 <= -0.5)
		tmp = t_2;
	elseif (t_1 <= 4e-15)
		tmp = fma(Float64(z - t), Float64(y / a), x);
	elseif (t_1 <= 5e+99)
		tmp = t_2;
	else
		tmp = Float64(z * Float64(y / Float64(a - t)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(1.0 - N[(z / t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], t$95$2, If[LessEqual[t$95$1, 4e-15], N[(N[(z - t), $MachinePrecision] * N[(y / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 5e+99], t$95$2, N[(z * N[(y / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -0.5 or 4.0000000000000003e-15 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.00000000000000008e99

   1. Initial program 99.3%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 90.3%

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

   if -0.5 < (/.f64 (-.f64 z t) (-.f64 a t)) < 4.0000000000000003e-15

   1. Initial program 99.1%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 96.6%

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

   if 5.00000000000000008e99 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 95.3%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 95.3

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

   4. Applied rewrites 95.3%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 86.4%

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

   9. Applied rewrites 86.5%

      \[\leadsto z \cdot \color{blue}{\frac{y}{a - t}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 92.1%

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

Alternative 4: 81.1% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -0.5)
     (fma (/ (- z) t) y x)
     (if (<= t_1 4e-15)
       (fma (/ z a) y x)
       (if (<= t_1 2.0) (fma y (/ a t) (+ x y)) (* (/ z (- a t)) y))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = fma((-z / t), y, x);
	} else if (t_1 <= 4e-15) {
		tmp = fma((z / a), y, x);
	} else if (t_1 <= 2.0) {
		tmp = fma(y, (a / t), (x + y));
	} else {
		tmp = (z / (a - t)) * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= -0.5)
		tmp = fma(Float64(Float64(-z) / t), y, x);
	elseif (t_1 <= 4e-15)
		tmp = fma(Float64(z / a), y, x);
	elseif (t_1 <= 2.0)
		tmp = fma(y, Float64(a / t), Float64(x + y));
	else
		tmp = Float64(Float64(z / Float64(a - t)) * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[((-z) / t), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 4e-15], N[(N[(z / a), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 2.0], N[(y * N[(a / t), $MachinePrecision] + N[(x + y), $MachinePrecision]), $MachinePrecision], N[(N[(z / N[(a - t), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -0.5

   1. Initial program 97.6%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 97.6

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

   4. Applied rewrites 97.6%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 71.1%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 67.9%

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

   if -0.5 < (/.f64 (-.f64 z t) (-.f64 a t)) < 4.0000000000000003e-15

   1. Initial program 99.1%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 91.4%

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

   if 4.0000000000000003e-15 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 99.7%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 99.7%

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

   if 2 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 97.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 80.9%

      \[\leadsto \color{blue}{\frac{z}{a - t} \cdot y} \]
3. Recombined 4 regimes into one program.

4. Final simplification 88.9%

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

Alternative 5: 81.1% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -0.5)
     (fma (/ (- z) t) y x)
     (if (<= t_1 4e-15)
       (fma (/ z a) y x)
       (if (<= t_1 2.0) (+ x y) (* (/ z (- a t)) y))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = fma((-z / t), y, x);
	} else if (t_1 <= 4e-15) {
		tmp = fma((z / a), y, x);
	} else if (t_1 <= 2.0) {
		tmp = x + y;
	} else {
		tmp = (z / (a - t)) * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= -0.5)
		tmp = fma(Float64(Float64(-z) / t), y, x);
	elseif (t_1 <= 4e-15)
		tmp = fma(Float64(z / a), y, x);
	elseif (t_1 <= 2.0)
		tmp = Float64(x + y);
	else
		tmp = Float64(Float64(z / Float64(a - t)) * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[((-z) / t), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 4e-15], N[(N[(z / a), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 2.0], N[(x + y), $MachinePrecision], N[(N[(z / N[(a - t), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -0.5

   1. Initial program 97.6%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 97.6

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

   4. Applied rewrites 97.6%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 71.1%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 67.9%

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

   if -0.5 < (/.f64 (-.f64 z t) (-.f64 a t)) < 4.0000000000000003e-15

   1. Initial program 99.1%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 91.4%

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

   if 4.0000000000000003e-15 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 99.5%

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

   if 2 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 97.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 80.9%

      \[\leadsto \color{blue}{\frac{z}{a - t} \cdot y} \]
3. Recombined 4 regimes into one program.

4. Final simplification 88.8%

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

Alternative 6: 78.3% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (fma (/ z a) y x)))
   (if (<= t_1 4e-15)
     t_2
     (if (<= t_1 2.0) (+ x y) (if (<= t_1 1e+120) (* (/ z (- t)) y) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = fma((z / a), y, x);
	double tmp;
	if (t_1 <= 4e-15) {
		tmp = t_2;
	} else if (t_1 <= 2.0) {
		tmp = x + y;
	} else if (t_1 <= 1e+120) {
		tmp = (z / -t) * y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = fma(Float64(z / a), y, x)
	tmp = 0.0
	if (t_1 <= 4e-15)
		tmp = t_2;
	elseif (t_1 <= 2.0)
		tmp = Float64(x + y);
	elseif (t_1 <= 1e+120)
		tmp = Float64(Float64(z / Float64(-t)) * y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z / a), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, 4e-15], t$95$2, If[LessEqual[t$95$1, 2.0], N[(x + y), $MachinePrecision], If[LessEqual[t$95$1, 1e+120], N[(N[(z / (-t)), $MachinePrecision] * y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 4.0000000000000003e-15 or 9.9999999999999998e119 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 79.0%

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

   if 4.0000000000000003e-15 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 99.5%

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

   if 2 < (/.f64 (-.f64 z t) (-.f64 a t)) < 9.9999999999999998e119

   1. Initial program 99.5%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 99.5

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

   4. Applied rewrites 99.5%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 76.6%

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

   8. Taylor expanded in t around inf

      \[\leadsto \frac{z}{-1 \cdot t} \cdot y \]
   9. Step-by-step derivation

   10. Applied rewrites 71.8%

       \[\leadsto \frac{z}{-t} \cdot y \]
3. Recombined 3 regimes into one program.

4. Final simplification 85.5%

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

Alternative 7: 71.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \frac{z}{a} \cdot y\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+58}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-34}:\\ \;\;\;\;x\\ \mathbf{elif}\;t\_1 \leq 10^{+120}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (* (/ z a) y)))
   (if (<= t_1 -1e+58)
     t_2
     (if (<= t_1 5e-34) x (if (<= t_1 1e+120) (+ x y) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (z / a) * y;
	double tmp;
	if (t_1 <= -1e+58) {
		tmp = t_2;
	} else if (t_1 <= 5e-34) {
		tmp = x;
	} else if (t_1 <= 1e+120) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (z - t) / (a - t)
    t_2 = (z / a) * y
    if (t_1 <= (-1d+58)) then
        tmp = t_2
    else if (t_1 <= 5d-34) then
        tmp = x
    else if (t_1 <= 1d+120) then
        tmp = x + y
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (z / a) * y;
	double tmp;
	if (t_1 <= -1e+58) {
		tmp = t_2;
	} else if (t_1 <= 5e-34) {
		tmp = x;
	} else if (t_1 <= 1e+120) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	t_2 = (z / a) * y
	tmp = 0
	if t_1 <= -1e+58:
		tmp = t_2
	elif t_1 <= 5e-34:
		tmp = x
	elif t_1 <= 1e+120:
		tmp = x + y
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(Float64(z / a) * y)
	tmp = 0.0
	if (t_1 <= -1e+58)
		tmp = t_2;
	elseif (t_1 <= 5e-34)
		tmp = x;
	elseif (t_1 <= 1e+120)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) / (a - t);
	t_2 = (z / a) * y;
	tmp = 0.0;
	if (t_1 <= -1e+58)
		tmp = t_2;
	elseif (t_1 <= 5e-34)
		tmp = x;
	elseif (t_1 <= 1e+120)
		tmp = x + y;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z / a), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+58], t$95$2, If[LessEqual[t$95$1, 5e-34], x, If[LessEqual[t$95$1, 1e+120], N[(x + y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -9.99999999999999944e57 or 9.9999999999999998e119 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 96.1%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 96.1

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

   4. Applied rewrites 96.1%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 77.1%

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

   8. Taylor expanded in t around 0

      \[\leadsto \frac{z}{a} \cdot y \]
   9. Step-by-step derivation

   10. Applied rewrites 55.8%

       \[\leadsto \frac{z}{a} \cdot y \]

   if -9.99999999999999944e57 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.0000000000000003e-34

   1. Initial program 99.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 71.6%

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

   if 5.0000000000000003e-34 < (/.f64 (-.f64 z t) (-.f64 a t)) < 9.9999999999999998e119

   1. Initial program 99.9%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 84.1%

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

4. Final simplification 74.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq -1 \cdot 10^{+58}:\\ \;\;\;\;\frac{z}{a} \cdot y\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 5 \cdot 10^{-34}:\\ \;\;\;\;x\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 10^{+120}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{a} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 71.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \frac{z \cdot y}{a}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+58}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-34}:\\ \;\;\;\;x\\ \mathbf{elif}\;t\_1 \leq 10^{+120}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (/ (* z y) a)))
   (if (<= t_1 -1e+58)
     t_2
     (if (<= t_1 5e-34) x (if (<= t_1 1e+120) (+ x y) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (z * y) / a;
	double tmp;
	if (t_1 <= -1e+58) {
		tmp = t_2;
	} else if (t_1 <= 5e-34) {
		tmp = x;
	} else if (t_1 <= 1e+120) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (z - t) / (a - t)
    t_2 = (z * y) / a
    if (t_1 <= (-1d+58)) then
        tmp = t_2
    else if (t_1 <= 5d-34) then
        tmp = x
    else if (t_1 <= 1d+120) then
        tmp = x + y
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (z * y) / a;
	double tmp;
	if (t_1 <= -1e+58) {
		tmp = t_2;
	} else if (t_1 <= 5e-34) {
		tmp = x;
	} else if (t_1 <= 1e+120) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	t_2 = (z * y) / a
	tmp = 0
	if t_1 <= -1e+58:
		tmp = t_2
	elif t_1 <= 5e-34:
		tmp = x
	elif t_1 <= 1e+120:
		tmp = x + y
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(Float64(z * y) / a)
	tmp = 0.0
	if (t_1 <= -1e+58)
		tmp = t_2;
	elseif (t_1 <= 5e-34)
		tmp = x;
	elseif (t_1 <= 1e+120)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) / (a - t);
	t_2 = (z * y) / a;
	tmp = 0.0;
	if (t_1 <= -1e+58)
		tmp = t_2;
	elseif (t_1 <= 5e-34)
		tmp = x;
	elseif (t_1 <= 1e+120)
		tmp = x + y;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z * y), $MachinePrecision] / a), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+58], t$95$2, If[LessEqual[t$95$1, 5e-34], x, If[LessEqual[t$95$1, 1e+120], N[(x + y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -9.99999999999999944e57 or 9.9999999999999998e119 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 96.1%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 96.1

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

   4. Applied rewrites 96.1%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 77.1%

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

   8. Taylor expanded in t around 0

      \[\leadsto \frac{y \cdot z}{\color{blue}{a}} \]
   9. Step-by-step derivation

   10. Applied rewrites 54.4%

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

   if -9.99999999999999944e57 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.0000000000000003e-34

   1. Initial program 99.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 71.6%

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

   if 5.0000000000000003e-34 < (/.f64 (-.f64 z t) (-.f64 a t)) < 9.9999999999999998e119

   1. Initial program 99.9%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 84.1%

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

4. Final simplification 73.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq -1 \cdot 10^{+58}:\\ \;\;\;\;\frac{z \cdot y}{a}\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 5 \cdot 10^{-34}:\\ \;\;\;\;x\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 10^{+120}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;\frac{z \cdot y}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 81.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 4e-15)
     (fma (/ z a) y x)
     (if (<= t_1 2.0) (+ x y) (* (/ z (- a t)) y)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= 4e-15) {
		tmp = fma((z / a), y, x);
	} else if (t_1 <= 2.0) {
		tmp = x + y;
	} else {
		tmp = (z / (a - t)) * y;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 4.0000000000000003e-15

   1. Initial program 98.6%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 80.4%

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

   if 4.0000000000000003e-15 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 99.5%

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

   if 2 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 97.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 80.9%

      \[\leadsto \color{blue}{\frac{z}{a - t} \cdot y} \]
3. Recombined 3 regimes into one program.

4. Final simplification 87.1%

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

Alternative 10: 79.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ \mathbf{if}\;t\_1 \leq 4 \cdot 10^{-15} \lor \neg \left(t\_1 \leq 10^{+120}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{a}, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (or (<= t_1 4e-15) (not (<= t_1 1e+120))) (fma (/ z a) y x) (+ x y))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if ((t_1 <= 4e-15) || !(t_1 <= 1e+120)) {
		tmp = fma((z / a), y, x);
	} else {
		tmp = x + y;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if ((t_1 <= 4e-15) || !(t_1 <= 1e+120))
		tmp = fma(Float64(z / a), y, x);
	else
		tmp = Float64(x + y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, 4e-15], N[Not[LessEqual[t$95$1, 1e+120]], $MachinePrecision]], N[(N[(z / a), $MachinePrecision] * y + x), $MachinePrecision], N[(x + y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 4.0000000000000003e-15 or 9.9999999999999998e119 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 79.0%

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

   if 4.0000000000000003e-15 < (/.f64 (-.f64 z t) (-.f64 a t)) < 9.9999999999999998e119

   1. Initial program 99.9%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 85.9%

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

4. Final simplification 81.9%

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

Alternative 11: 81.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -2.25e-79) (not (<= t 5600000.0)))
   (fma (- 1.0 (/ z t)) y x)
   (+ x (/ (* z y) a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -2.25e-79) || !(t <= 5600000.0)) {
		tmp = fma((1.0 - (z / t)), y, x);
	} else {
		tmp = x + ((z * y) / a);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -2.25e-79) || !(t <= 5600000.0))
		tmp = fma(Float64(1.0 - Float64(z / t)), y, x);
	else
		tmp = Float64(x + Float64(Float64(z * y) / a));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -2.25e-79], N[Not[LessEqual[t, 5600000.0]], $MachinePrecision]], N[(N[(1.0 - N[(z / t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision], N[(x + N[(N[(z * y), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -2.2500000000000001e-79 or 5.6e6 < t

   1. Initial program 99.9%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 89.7%

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

   if -2.2500000000000001e-79 < t < 5.6e6

   1. Initial program 97.4%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 89.2%

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

4. Final simplification 89.5%

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

Alternative 12: 66.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq 9 \cdot 10^{-32}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (/ (- z t) (- a t)) 9e-32) x (+ x y)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) / (a - t)) <= 9e-32) {
		tmp = x;
	} else {
		tmp = x + 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, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (((z - t) / (a - t)) <= 9d-32) then
        tmp = x
    else
        tmp = x + y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) / (a - t)) <= 9e-32) {
		tmp = x;
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((z - t) / (a - t)) <= 9e-32:
		tmp = x
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(Float64(z - t) / Float64(a - t)) <= 9e-32)
		tmp = x;
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((z - t) / (a - t)) <= 9e-32)
		tmp = x;
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision], 9e-32], x, N[(x + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 9.00000000000000009e-32

   1. Initial program 98.6%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 60.5%

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

   if 9.00000000000000009e-32 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 99.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 74.3%

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

4. Final simplification 67.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq 9 \cdot 10^{-32}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 50.5% accurate, 26.0× speedup

Math

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

FPCore

(FPCore (x y z t a) :precision binary64 x)

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x
end function

Java

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

Python

def code(x, y, z, t, a):
	return x

Julia

function code(x, y, z, t, a)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := x

Derivation

1. Initial program 98.9%

   \[x + y \cdot \frac{z - t}{a - t} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

5. Applied rewrites 49.2%

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

6. Final simplification 49.2%

   \[\leadsto x \]
7. Add Preprocessing

Developer Target 1: 99.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + y \cdot \frac{z - t}{a - t}\\ \mathbf{if}\;y < -8.508084860551241 \cdot 10^{-17}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y < 2.894426862792089 \cdot 10^{-49}:\\ \;\;\;\;x + \left(y \cdot \left(z - t\right)\right) \cdot \frac{1}{a - t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* y (/ (- z t) (- a t))))))
   (if (< y -8.508084860551241e-17)
     t_1
     (if (< y 2.894426862792089e-49)
       (+ x (* (* y (- z t)) (/ 1.0 (- a t))))
       t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (y * ((z - t) / (a - t)));
	double tmp;
	if (y < -8.508084860551241e-17) {
		tmp = t_1;
	} else if (y < 2.894426862792089e-49) {
		tmp = x + ((y * (z - t)) * (1.0 / (a - t)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x + (y * ((z - t) / (a - t)))
    if (y < (-8.508084860551241d-17)) then
        tmp = t_1
    else if (y < 2.894426862792089d-49) then
        tmp = x + ((y * (z - t)) * (1.0d0 / (a - t)))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (y * ((z - t) / (a - t)));
	double tmp;
	if (y < -8.508084860551241e-17) {
		tmp = t_1;
	} else if (y < 2.894426862792089e-49) {
		tmp = x + ((y * (z - t)) * (1.0 / (a - t)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x + N[(y * N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[y, -8.508084860551241e-17], t$95$1, If[Less[y, 2.894426862792089e-49], N[(x + N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Reproduce

herbie shell --seed 2025021 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisLine from plot-0.2.3.4, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< y -8508084860551241/100000000000000000000000000000000) (+ x (* y (/ (- z t) (- a t)))) (if (< y 2894426862792089/10000000000000000000000000000000000000000000000000000000000000000) (+ x (* (* y (- z t)) (/ 1 (- a t)))) (+ x (* y (/ (- z t) (- a t)))))))

  (+ x (* y (/ (- z t) (- a t)))))