Graphics.Rendering.Plot.Render.Plot.Axis:tickPosition from plot-0.2.3.4

Percentage Accurate: 97.8% → 97.8%

Time: 3.9s

Alternatives: 9

Speedup: 0.5×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.8% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 z t) < -2 or 2.5e26 < (/.f64 z t)

   1. Initial program 97.0%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 93.4

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

   4. Applied rewrites 93.4%

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

   if -2 < (/.f64 z t) < 2.5e26

   1. Initial program 98.5%

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

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 95.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 95.8

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

   6. Applied rewrites 95.8%

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

Alternative 2: 94.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.8%

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

Alternative 3: 92.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.8%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift--.f64 N/A

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

   4. lift-/.f64 N/A

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

   5. +-commutative N/A

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

   6. associate-*r/ N/A

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

   7. associate-*l/ N/A

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

   8. sub-div N/A

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

   9. lower-fma.f64 N/A

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

   10. sub-div N/A

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

   11. lower-/.f64 N/A

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

   12. lift--.f64 92.8

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

3. Applied rewrites 92.8%

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

Alternative 4: 86.3% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ (- t z) t) x)))
   (if (<= x -6.5e+38) t_1 (if (<= x 41000000.0) (fma (/ z t) y x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((t - z) / t) * x;
	double tmp;
	if (x <= -6.5e+38) {
		tmp = t_1;
	} else if (x <= 41000000.0) {
		tmp = fma((z / t), y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(t - z) / t) * x)
	tmp = 0.0
	if (x <= -6.5e+38)
		tmp = t_1;
	elseif (x <= 41000000.0)
		tmp = fma(Float64(z / t), y, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(t - z), $MachinePrecision] / t), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, -6.5e+38], t$95$1, If[LessEqual[x, 41000000.0], N[(N[(z / t), $MachinePrecision] * y + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.5e38 or 4.1e7 < x

   1. Initial program 99.9%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

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

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lift-/.f64 88.4

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

   4. Applied rewrites 88.4%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - z}{t} \cdot x \]

      2. lower--.f64 88.4

         \[\leadsto \frac{t - z}{t} \cdot x \]

   7. Applied rewrites 88.4%

      \[\leadsto \frac{t - z}{t} \cdot x \]

   if -6.5e38 < x < 4.1e7

   1. Initial program 96.0%

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

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 84.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 84.5

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

   6. Applied rewrites 84.5%

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

Alternative 5: 77.3% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ (- z) t) x)))
   (if (<= (/ z t) -2e+95) t_1 (if (<= (/ z t) 5e+56) (fma (/ z t) y x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (-z / t) * x;
	double tmp;
	if ((z / t) <= -2e+95) {
		tmp = t_1;
	} else if ((z / t) <= 5e+56) {
		tmp = fma((z / t), y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 z t) < -2.00000000000000004e95 or 5.00000000000000024e56 < (/.f64 z t)

   1. Initial program 96.3%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

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

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lift-/.f64 57.8

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

   4. Applied rewrites 57.8%

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

   5. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 57.8

         \[\leadsto \frac{-z}{t} \cdot x \]

   7. Applied rewrites 57.8%

      \[\leadsto \frac{-z}{t} \cdot x \]

   if -2.00000000000000004e95 < (/.f64 z t) < 5.00000000000000024e56

   1. Initial program 98.7%

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

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 89.3%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 89.3

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

   6. Applied rewrites 89.3%

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

Alternative 6: 73.5% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x (* (- y x) (/ z t))) -5e+293)
   (* (/ (- z) t) x)
   (fma (/ y t) z x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 (-.f64 y x) (/.f64 z t))) < -5.00000000000000033e293

   1. Initial program 95.5%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

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

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lift-/.f64 62.5

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

   4. Applied rewrites 62.5%

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

   5. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 58.8

         \[\leadsto \frac{-z}{t} \cdot x \]

   7. Applied rewrites 58.8%

      \[\leadsto \frac{-z}{t} \cdot x \]

   if -5.00000000000000033e293 < (+.f64 x (*.f64 (-.f64 y x) (/.f64 z t)))

   1. Initial program 98.2%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*r/ N/A

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

      7. associate-*l/ N/A

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

      8. sub-div N/A

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

      9. lower-fma.f64 N/A

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

      10. sub-div N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 92.0

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

   3. Applied rewrites 92.0%

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

   4. Taylor expanded in x around 0

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

      1. lower-/.f64 76.1

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

   6. Applied rewrites 76.1%

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

Alternative 7: 64.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z}{t} \cdot y\\ t_2 := \frac{-z}{t} \cdot x\\ \mathbf{if}\;\frac{z}{t} \leq -2 \cdot 10^{+95}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;\frac{z}{t} \leq -1 \cdot 10^{-36}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;\frac{z}{t} \leq 10^{-125}:\\ \;\;\;\;x\\ \mathbf{elif}\;\frac{z}{t} \leq 5 \cdot 10^{+56}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ z t) y)) (t_2 (* (/ (- z) t) x)))
   (if (<= (/ z t) -2e+95)
     t_2
     (if (<= (/ z t) -1e-36)
       t_1
       (if (<= (/ z t) 1e-125) x (if (<= (/ z t) 5e+56) t_1 t_2))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z / t) * y;
	double t_2 = (-z / t) * x;
	double tmp;
	if ((z / t) <= -2e+95) {
		tmp = t_2;
	} else if ((z / t) <= -1e-36) {
		tmp = t_1;
	} else if ((z / t) <= 1e-125) {
		tmp = x;
	} else if ((z / t) <= 5e+56) {
		tmp = t_1;
	} 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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (z / t) * y
    t_2 = (-z / t) * x
    if ((z / t) <= (-2d+95)) then
        tmp = t_2
    else if ((z / t) <= (-1d-36)) then
        tmp = t_1
    else if ((z / t) <= 1d-125) then
        tmp = x
    else if ((z / t) <= 5d+56) then
        tmp = t_1
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (z / t) * y;
	double t_2 = (-z / t) * x;
	double tmp;
	if ((z / t) <= -2e+95) {
		tmp = t_2;
	} else if ((z / t) <= -1e-36) {
		tmp = t_1;
	} else if ((z / t) <= 1e-125) {
		tmp = x;
	} else if ((z / t) <= 5e+56) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z / t) * y
	t_2 = (-z / t) * x
	tmp = 0
	if (z / t) <= -2e+95:
		tmp = t_2
	elif (z / t) <= -1e-36:
		tmp = t_1
	elif (z / t) <= 1e-125:
		tmp = x
	elif (z / t) <= 5e+56:
		tmp = t_1
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z / t) * y)
	t_2 = Float64(Float64(Float64(-z) / t) * x)
	tmp = 0.0
	if (Float64(z / t) <= -2e+95)
		tmp = t_2;
	elseif (Float64(z / t) <= -1e-36)
		tmp = t_1;
	elseif (Float64(z / t) <= 1e-125)
		tmp = x;
	elseif (Float64(z / t) <= 5e+56)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z / t) * y;
	t_2 = (-z / t) * x;
	tmp = 0.0;
	if ((z / t) <= -2e+95)
		tmp = t_2;
	elseif ((z / t) <= -1e-36)
		tmp = t_1;
	elseif ((z / t) <= 1e-125)
		tmp = x;
	elseif ((z / t) <= 5e+56)
		tmp = t_1;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 z t) < -2.00000000000000004e95 or 5.00000000000000024e56 < (/.f64 z t)

   1. Initial program 96.3%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

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

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lift-/.f64 57.8

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

   4. Applied rewrites 57.8%

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

   5. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 57.8

         \[\leadsto \frac{-z}{t} \cdot x \]

   7. Applied rewrites 57.8%

      \[\leadsto \frac{-z}{t} \cdot x \]

   if -2.00000000000000004e95 < (/.f64 z t) < -9.9999999999999994e-37 or 1.00000000000000001e-125 < (/.f64 z t) < 5.00000000000000024e56

   1. Initial program 99.7%

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

   2. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-*.f64 N/A

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

      4. lift-/.f64 48.2

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

   4. Applied rewrites 48.2%

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

   if -9.9999999999999994e-37 < (/.f64 z t) < 1.00000000000000001e-125

   1. Initial program 98.0%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 81.2%

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

Alternative 8: 64.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z}{t} \cdot y\\ \mathbf{if}\;\frac{z}{t} \leq -1 \cdot 10^{-36}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;\frac{z}{t} \leq 10^{-125}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ z t) y)))
   (if (<= (/ z t) -1e-36) t_1 (if (<= (/ z t) 1e-125) x t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z / t) * y;
	double tmp;
	if ((z / t) <= -1e-36) {
		tmp = t_1;
	} else if ((z / t) <= 1e-125) {
		tmp = x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z / t) * y
    if ((z / t) <= (-1d-36)) then
        tmp = t_1
    else if ((z / t) <= 1d-125) then
        tmp = x
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (z / t) * y;
	double tmp;
	if ((z / t) <= -1e-36) {
		tmp = t_1;
	} else if ((z / t) <= 1e-125) {
		tmp = x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z / t) * y
	tmp = 0
	if (z / t) <= -1e-36:
		tmp = t_1
	elif (z / t) <= 1e-125:
		tmp = x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z / t) * y)
	tmp = 0.0
	if (Float64(z / t) <= -1e-36)
		tmp = t_1;
	elseif (Float64(z / t) <= 1e-125)
		tmp = x;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z / t) * y;
	tmp = 0.0;
	if ((z / t) <= -1e-36)
		tmp = t_1;
	elseif ((z / t) <= 1e-125)
		tmp = x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z / t), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[N[(z / t), $MachinePrecision], -1e-36], t$95$1, If[LessEqual[N[(z / t), $MachinePrecision], 1e-125], x, t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 z t) < -9.9999999999999994e-37 or 1.00000000000000001e-125 < (/.f64 z t)

   1. Initial program 97.6%

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

   2. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-*.f64 N/A

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

      4. lift-/.f64 53.4

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

   4. Applied rewrites 53.4%

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

   if -9.9999999999999994e-37 < (/.f64 z t) < 1.00000000000000001e-125

   1. Initial program 98.0%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 81.2%

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

Alternative 9: 38.9% accurate, 12.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.8%

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

2. Taylor expanded in z around 0

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

4. Applied rewrites 38.9%

   \[\leadsto \color{blue}{x} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025118 
(FPCore (x y z t)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:tickPosition from plot-0.2.3.4"
  :precision binary64
  (+ x (* (- y x) (/ z t))))