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

Percentage Accurate: 98.1% → 98.1%

Time: 15.2s

Alternatives: 9

Speedup: 1.0×

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.1% 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.1% accurate, 1.0× 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.1%

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

3. Applied rewrites 98.1%

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

Alternative 2: 96.1% 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 - t}, y, x\right)\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+35}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 0.4:\\ \;\;\;\;\mathsf{fma}\left(\frac{z - t}{a}, y, x\right)\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;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 (fma (/ z (- a t)) y x)))
   (if (<= t_1 -5e+35)
     t_2
     (if (<= t_1 0.4) (fma (/ (- z t) a) y x) (if (<= t_1 2.0) (+ 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 = fma((z / (a - t)), y, x);
	double tmp;
	if (t_1 <= -5e+35) {
		tmp = t_2;
	} else if (t_1 <= 0.4) {
		tmp = fma(((z - t) / a), y, x);
	} else if (t_1 <= 2.0) {
		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 = fma(Float64(z / Float64(a - t)), y, x)
	tmp = 0.0
	if (t_1 <= -5e+35)
		tmp = t_2;
	elseif (t_1 <= 0.4)
		tmp = fma(Float64(Float64(z - t) / a), y, x);
	elseif (t_1 <= 2.0)
		tmp = Float64(x + 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 / N[(a - t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+35], t$95$2, If[LessEqual[t$95$1, 0.4], N[(N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 2.0], N[(x + y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 98.1%

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

   3. Applied rewrites 98.1%

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

   4. Taylor expanded in t around inf

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

   6. Applied rewrites 94.9%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 76.6%

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

   if -5.00000000000000021e35 < (/.f64 (-.f64 z t) (-.f64 a t)) < 0.40000000000000002

   1. Initial program 98.1%

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

   3. Applied rewrites 98.1%

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

   4. Taylor expanded in t around 0

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

   6. Applied rewrites 59.8%

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

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

   1. Initial program 98.1%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.1%

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

Alternative 3: 95.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.1%

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

3. Applied rewrites 95.8%

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

Alternative 4: 92.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \mathsf{fma}\left(\frac{z}{a - t}, y, x\right)\\ \mathbf{if}\;t\_1 \leq 2 \cdot 10^{-11}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;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 (fma (/ z (- a t)) y x)))
   (if (<= t_1 2e-11) t_2 (if (<= t_1 2.0) (+ 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 = fma((z / (a - t)), y, x);
	double tmp;
	if (t_1 <= 2e-11) {
		tmp = t_2;
	} else if (t_1 <= 2.0) {
		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 = fma(Float64(z / Float64(a - t)), y, x)
	tmp = 0.0
	if (t_1 <= 2e-11)
		tmp = t_2;
	elseif (t_1 <= 2.0)
		tmp = Float64(x + 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 / N[(a - t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-11], t$95$2, If[LessEqual[t$95$1, 2.0], N[(x + y), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 1.99999999999999988e-11 or 2 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

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

   3. Applied rewrites 98.1%

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

   4. Taylor expanded in t around inf

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

   6. Applied rewrites 94.9%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 76.6%

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

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

   1. Initial program 98.1%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.1%

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

Alternative 5: 84.1% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ z a) y x))
        (t_2 (/ (- z t) (- a t)))
        (t_3 (/ (* y z) (- a t))))
   (if (<= t_2 -5e+116)
     t_3
     (if (<= t_2 2e-11)
       t_1
       (if (<= t_2 2.0) (+ x y) (if (<= t_2 5e+166) t_1 t_3))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((z / a), y, x);
	double t_2 = (z - t) / (a - t);
	double t_3 = (y * z) / (a - t);
	double tmp;
	if (t_2 <= -5e+116) {
		tmp = t_3;
	} else if (t_2 <= 2e-11) {
		tmp = t_1;
	} else if (t_2 <= 2.0) {
		tmp = x + y;
	} else if (t_2 <= 5e+166) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(z / a), y, x)
	t_2 = Float64(Float64(z - t) / Float64(a - t))
	t_3 = Float64(Float64(y * z) / Float64(a - t))
	tmp = 0.0
	if (t_2 <= -5e+116)
		tmp = t_3;
	elseif (t_2 <= 2e-11)
		tmp = t_1;
	elseif (t_2 <= 2.0)
		tmp = Float64(x + y);
	elseif (t_2 <= 5e+166)
		tmp = t_1;
	else
		tmp = t_3;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -5.00000000000000025e116 or 5.0000000000000002e166 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 26.4%

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

   if -5.00000000000000025e116 < (/.f64 (-.f64 z t) (-.f64 a t)) < 1.99999999999999988e-11 or 2 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.0000000000000002e166

   1. Initial program 98.1%

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

   3. Applied rewrites 98.1%

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

   4. Taylor expanded in t around inf

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

   6. Applied rewrites 94.9%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 76.6%

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

   10. Taylor expanded in t around 0

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

   12. Applied rewrites 61.5%

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

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

   1. Initial program 98.1%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.1%

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

Alternative 6: 80.7% accurate, 0.4× 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 2 \cdot 10^{-11}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;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 (fma (/ z a) y x)))
   (if (<= t_1 2e-11) t_2 (if (<= t_1 2.0) (+ 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 = fma((z / a), y, x);
	double tmp;
	if (t_1 <= 2e-11) {
		tmp = t_2;
	} else if (t_1 <= 2.0) {
		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 = fma(Float64(z / a), y, x)
	tmp = 0.0
	if (t_1 <= 2e-11)
		tmp = t_2;
	elseif (t_1 <= 2.0)
		tmp = Float64(x + 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, 2e-11], t$95$2, If[LessEqual[t$95$1, 2.0], N[(x + y), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 1.99999999999999988e-11 or 2 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.1%

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

   3. Applied rewrites 98.1%

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

   4. Taylor expanded in t around inf

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

   6. Applied rewrites 94.9%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 76.6%

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

   10. Taylor expanded in t around 0

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

   12. Applied rewrites 61.5%

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

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

   1. Initial program 98.1%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.1%

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

Alternative 7: 66.2% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y z) a)) (t_2 (+ x (* y (/ (- z t) (- a t))))))
   (if (<= t_2 (- INFINITY)) t_1 (if (<= t_2 2e+307) (+ x y) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * z) / a;
	double t_2 = x + (y * ((z - t) / (a - t)));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_2 <= 2e+307) {
		tmp = x + y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * z) / a;
	double t_2 = x + (y * ((z - t) / (a - t)));
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_2 <= 2e+307) {
		tmp = x + y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y * z) / a
	t_2 = x + (y * ((z - t) / (a - t)))
	tmp = 0
	if t_2 <= -math.inf:
		tmp = t_1
	elif t_2 <= 2e+307:
		tmp = x + y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y * z) / a)
	t_2 = Float64(x + Float64(y * Float64(Float64(z - t) / Float64(a - t))))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_2 <= 2e+307)
		tmp = Float64(x + y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y * z) / a;
	t_2 = x + (y * ((z - t) / (a - t)));
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = t_1;
	elseif (t_2 <= 2e+307)
		tmp = x + y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 a t)))) < -inf.0 or 1.99999999999999997e307 < (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 a t))))

   1. Initial program 98.1%

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

   3. Applied rewrites 98.1%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 39.3%

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

   7. Taylor expanded in t around 0

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

   9. Applied rewrites 18.6%

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

   if -inf.0 < (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 a t)))) < 1.99999999999999997e307

   1. Initial program 98.1%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.1%

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

Alternative 8: 60.1% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, 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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(x + y), $MachinePrecision]

Derivation

1. Initial program 98.1%

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

2. Taylor expanded in t around inf

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

4. Applied rewrites 60.1%

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

Alternative 9: 18.8% accurate, 15.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, 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 = y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.1%

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

2. Taylor expanded in t around inf

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

4. Applied rewrites 60.1%

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

5. Taylor expanded in x around 0

   \[\leadsto y \]

7. Applied rewrites 18.8%

   \[\leadsto y \]
8. Add Preprocessing

Reproduce

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