Optimisation.CirclePacking:place from circle-packing-0.1.0.4, F

Percentage Accurate: 93.4% → 99.3%

Time: 8.7s

Alternatives: 10

Speedup: 1.1×

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

Specification

Math

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

FPCore

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

C

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

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)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 93.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.3% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (-.f64 z t)) < -9.99999999999999991e238 or 5.00000000000000007e121 < (*.f64 y (-.f64 z t))

   1. Initial program 93.4%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. associate-/l* N/A

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

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

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

      7. distribute-lft-neg-in N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. div-sub N/A

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

      10. sub-negate-rev N/A

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

      11. +-commutative N/A

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

      12. sub-negate-rev N/A

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

      13. div-sub N/A

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

      14. distribute-rgt-neg-out N/A

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

      15. associate-/l* N/A

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

      16. mult-flip N/A

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

      17. distribute-lft-neg-in N/A

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

      18. lower-fma.f64 N/A

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

   3. Applied rewrites 93.3%

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

      1. lift-/.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. associate-*l* N/A

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

      6. mult-flip N/A

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

      7. lower-fma.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-/.f64 96.9

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

   5. Applied rewrites 96.9%

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

   if -9.99999999999999991e238 < (*.f64 y (-.f64 z t)) < 5.00000000000000007e121

   1. Initial program 93.4%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 96.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 93.4%

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

   1. lift--.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift--.f64 N/A

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

   5. associate-/l* N/A

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

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

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

   7. distribute-lft-neg-in N/A

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

   8. distribute-rgt-neg-out N/A

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

   9. div-sub N/A

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

   10. sub-negate-rev N/A

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

   11. +-commutative N/A

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

   12. sub-negate-rev N/A

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

   13. div-sub N/A

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

   14. distribute-rgt-neg-out N/A

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

   15. associate-/l* N/A

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

   16. mult-flip N/A

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

   17. distribute-lft-neg-in N/A

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

   18. lower-fma.f64 N/A

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

3. Applied rewrites 93.3%

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

   1. lift-/.f64 N/A

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

   2. lift-fma.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift--.f64 N/A

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

   5. associate-*l* N/A

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

   6. mult-flip N/A

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

   7. lower-fma.f64 N/A

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

   8. lift--.f64 N/A

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

   9. lift-/.f64 96.9

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

5. Applied rewrites 96.9%

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

Alternative 3: 85.4% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y (- z t)) a)) (t_2 (* (/ (- t z) a) y)))
   (if (<= t_1 -1e+193)
     t_2
     (if (<= t_1 5e+196)
       (- x (/ (* z y) a))
       (if (<= t_1 4e+306) (/ (* (- t z) y) a) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / a;
	double t_2 = ((t - z) / a) * y;
	double tmp;
	if (t_1 <= -1e+193) {
		tmp = t_2;
	} else if (t_1 <= 5e+196) {
		tmp = x - ((z * y) / a);
	} else if (t_1 <= 4e+306) {
		tmp = ((t - z) * y) / a;
	} 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 = (y * (z - t)) / a
    t_2 = ((t - z) / a) * y
    if (t_1 <= (-1d+193)) then
        tmp = t_2
    else if (t_1 <= 5d+196) then
        tmp = x - ((z * y) / a)
    else if (t_1 <= 4d+306) then
        tmp = ((t - z) * y) / a
    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 = (y * (z - t)) / a;
	double t_2 = ((t - z) / a) * y;
	double tmp;
	if (t_1 <= -1e+193) {
		tmp = t_2;
	} else if (t_1 <= 5e+196) {
		tmp = x - ((z * y) / a);
	} else if (t_1 <= 4e+306) {
		tmp = ((t - z) * y) / a;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -1.00000000000000007e193 or 4.00000000000000007e306 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 93.4%

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

   2. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. associate-/l* N/A

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

      3. distribute-rgt-neg-out N/A

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

      4. div-sub N/A

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

      5. sub-negate-rev N/A

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

      6. sub-negate-rev N/A

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

      7. div-sub N/A

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

      8. mul-1-neg N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. distribute-neg-frac N/A

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

      13. sub-negate-rev N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 56.7

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

   4. Applied rewrites 56.7%

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

   if -1.00000000000000007e193 < (/.f64 (*.f64 y (-.f64 z t)) a) < 4.9999999999999998e196

   1. Initial program 93.4%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 68.6

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

   4. Applied rewrites 68.6%

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

   if 4.9999999999999998e196 < (/.f64 (*.f64 y (-.f64 z t)) a) < 4.00000000000000007e306

   1. Initial program 93.4%

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

   2. Taylor expanded in a around 0

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

      1. lower-/.f64 N/A

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

      2. sub-flip N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. distribute-lft-neg-in N/A

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

      6. sub-negate-rev N/A

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

      7. lower-fma.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 83.6

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

   4. Applied rewrites 83.6%

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

   5. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 56.7

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

   7. Applied rewrites 56.7%

      \[\leadsto \frac{\left(t - z\right) \cdot y}{a} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 84.7% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -4.0000000000000002e117 or 4.00000000000000007e306 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 93.4%

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

   2. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. associate-/l* N/A

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

      3. distribute-rgt-neg-out N/A

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

      4. div-sub N/A

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

      5. sub-negate-rev N/A

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

      6. sub-negate-rev N/A

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

      7. div-sub N/A

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

      8. mul-1-neg N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. distribute-neg-frac N/A

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

      13. sub-negate-rev N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 56.7

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

   4. Applied rewrites 56.7%

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

   if -4.0000000000000002e117 < (/.f64 (*.f64 y (-.f64 z t)) a) < 9.99999999999999998e97

   1. Initial program 93.4%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. add-flip N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 71.0

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

   4. Applied rewrites 71.0%

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

      1. lift-/.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-*r/ N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 68.0

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

   6. Applied rewrites 68.0%

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

   if 9.99999999999999998e97 < (/.f64 (*.f64 y (-.f64 z t)) a) < 4.00000000000000007e306

   1. Initial program 93.4%

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

   2. Taylor expanded in a around 0

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

      1. lower-/.f64 N/A

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

      2. sub-flip N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. distribute-lft-neg-in N/A

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

      6. sub-negate-rev N/A

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

      7. lower-fma.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 83.6

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

   4. Applied rewrites 83.6%

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

   5. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 56.7

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

   7. Applied rewrites 56.7%

      \[\leadsto \frac{\left(t - z\right) \cdot y}{a} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 82.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -4.0000000000000002e117 or 9.99999999999999998e97 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 93.4%

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

   2. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. associate-/l* N/A

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

      3. distribute-rgt-neg-out N/A

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

      4. div-sub N/A

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

      5. sub-negate-rev N/A

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

      6. sub-negate-rev N/A

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

      7. div-sub N/A

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

      8. mul-1-neg N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. distribute-neg-frac N/A

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

      13. sub-negate-rev N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 56.7

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

   4. Applied rewrites 56.7%

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

   if -4.0000000000000002e117 < (/.f64 (*.f64 y (-.f64 z t)) a) < 9.99999999999999998e97

   1. Initial program 93.4%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. add-flip N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 71.0

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

   4. Applied rewrites 71.0%

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

      1. lift-/.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-*r/ N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 68.0

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

   6. Applied rewrites 68.0%

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

Alternative 6: 73.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.9e+194) (* (- z) (/ y a)) (fma (/ y a) t x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.8999999999999999e194

   1. Initial program 93.4%

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

   2. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. mul-1-neg N/A

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

      7. lower-*.f64 N/A

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

      8. lower-neg.f64 N/A

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

      9. lower-/.f64 34.2

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

   4. Applied rewrites 34.2%

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

   if -1.8999999999999999e194 < z

   1. Initial program 93.4%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. add-flip N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 71.0

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

   4. Applied rewrites 71.0%

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

Alternative 7: 70.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -7.2e+193) (* (- z) (/ y a)) (fma (/ t a) y x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -7.2e193

   1. Initial program 93.4%

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

   2. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. mul-1-neg N/A

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

      7. lower-*.f64 N/A

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

      8. lower-neg.f64 N/A

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

      9. lower-/.f64 34.2

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

   4. Applied rewrites 34.2%

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

   if -7.2e193 < z

   1. Initial program 93.4%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. add-flip N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 71.0

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

   4. Applied rewrites 71.0%

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

      1. lift-/.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-*r/ N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 68.0

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

   6. Applied rewrites 68.0%

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

Alternative 8: 49.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / a;
	double t_2 = (y / a) * t;
	double tmp;
	if (t_1 <= -1e+193) {
		tmp = t_2;
	} else if (t_1 <= 5e+196) {
		tmp = (x * a) / a;
	} 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 = (y * (z - t)) / a
    t_2 = (y / a) * t
    if (t_1 <= (-1d+193)) then
        tmp = t_2
    else if (t_1 <= 5d+196) then
        tmp = (x * a) / a
    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 = (y * (z - t)) / a;
	double t_2 = (y / a) * t;
	double tmp;
	if (t_1 <= -1e+193) {
		tmp = t_2;
	} else if (t_1 <= 5e+196) {
		tmp = (x * a) / a;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -1.00000000000000007e193 or 4.9999999999999998e196 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 93.4%

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

   2. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 31.3

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

   4. Applied rewrites 31.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. associate-*l/ N/A

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

      5. lower-*.f64 N/A

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

      6. lift-/.f64 33.6

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

   6. Applied rewrites 33.6%

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

   if -1.00000000000000007e193 < (/.f64 (*.f64 y (-.f64 z t)) a) < 4.9999999999999998e196

   1. Initial program 93.4%

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

   2. Taylor expanded in a around 0

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

      1. lower-/.f64 N/A

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

      2. sub-flip N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. distribute-lft-neg-in N/A

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

      6. sub-negate-rev N/A

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

      7. lower-fma.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-*.f64 83.6

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

   4. Applied rewrites 83.6%

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

   5. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 56.7

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

   7. Applied rewrites 56.7%

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

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{x \cdot a}{a} \]

      2. lower-*.f64 29.3

         \[\leadsto \frac{x \cdot a}{a} \]

   10. Applied rewrites 29.3%

       \[\leadsto \frac{x \cdot a}{a} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 33.6% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \frac{y}{a} \cdot t \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	return (y / 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 = (y / a) * t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.4%

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

2. Taylor expanded in t around inf

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

   1. *-commutative N/A

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

   2. associate-/l* N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 31.3

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

4. Applied rewrites 31.3%

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

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. associate-*r/ N/A

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

   4. associate-*l/ N/A

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

   5. lower-*.f64 N/A

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

   6. lift-/.f64 33.6

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

6. Applied rewrites 33.6%

   \[\leadsto \frac{y}{a} \cdot \color{blue}{t} \]
7. Add Preprocessing

Alternative 10: 31.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ y \cdot \frac{t}{a} \end{array} \]

FPCore

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

C

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

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 * (t / a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.4%

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

2. Taylor expanded in t around inf

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

   1. *-commutative N/A

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

   2. associate-/l* N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 31.3

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

4. Applied rewrites 31.3%

   \[\leadsto \color{blue}{y \cdot \frac{t}{a}} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025132 
(FPCore (x y z t a)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, F"
  :precision binary64
  (- x (/ (* y (- z t)) a)))