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

Percentage Accurate: 93.3% → 99.1%

Time: 2.6s

Alternatives: 8

Speedup: 1.1×

• 24.5% 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.3% 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.1% accurate, 0.4× speedup

Math

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (-.f64 z t)) < -inf.0 or 1.00000000000000004e93 < (*.f64 y (-.f64 z t))

   1. Initial program 82.3%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. negate-sub N/A

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

      4. mul-1-neg N/A

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

      5. distribute-rgt-in N/A

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

      6. *-commutative N/A

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

      7. mul-1-neg N/A

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

      8. fp-cancel-sub-sign N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-*.f64 78.4

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

   3. Applied rewrites 78.4%

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

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. +-commutative N/A

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

      7. distribute-rgt-out-- N/A

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

      8. *-commutative N/A

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

      9. associate-/l* N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. lift-/.f64 98.8

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

   5. Applied rewrites 98.8%

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

   if -inf.0 < (*.f64 y (-.f64 z t)) < 1.00000000000000004e93

   1. Initial program 99.3%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. negate-sub N/A

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

      4. mul-1-neg N/A

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

      5. distribute-rgt-in N/A

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

      6. *-commutative N/A

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

      7. mul-1-neg N/A

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

      8. fp-cancel-sub-sign N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-*.f64 99.3

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

   3. Applied rewrites 99.3%

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

Alternative 2: 99.1% accurate, 0.4× speedup

Math

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

   1. Initial program 82.3%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. negate-sub N/A

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

      4. mul-1-neg N/A

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

      5. distribute-rgt-in N/A

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

      6. *-commutative N/A

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

      7. mul-1-neg N/A

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

      8. fp-cancel-sub-sign N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-*.f64 78.4

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

   3. Applied rewrites 78.4%

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

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. +-commutative N/A

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

      7. distribute-rgt-out-- N/A

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

      8. *-commutative N/A

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

      9. associate-/l* N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. lift-/.f64 98.8

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

   5. Applied rewrites 98.8%

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

   if -inf.0 < (*.f64 y (-.f64 z t)) < 1.00000000000000004e93

   1. Initial program 99.3%

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

Alternative 3: 96.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 93.3%

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

   1. lift-*.f64 N/A

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

   2. lift--.f64 N/A

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

   3. negate-sub N/A

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

   4. mul-1-neg N/A

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

   5. distribute-rgt-in N/A

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

   6. *-commutative N/A

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

   7. mul-1-neg N/A

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

   8. fp-cancel-sub-sign N/A

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

   9. lower--.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 N/A

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

   12. lower-*.f64 91.9

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

3. Applied rewrites 91.9%

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

   1. lift-+.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. lift--.f64 N/A

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

   6. +-commutative N/A

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

   7. distribute-rgt-out-- N/A

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

   8. *-commutative N/A

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

   9. associate-/l* N/A

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

   10. lower-fma.f64 N/A

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

   11. lift--.f64 N/A

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

   12. lift-/.f64 96.8

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

5. Applied rewrites 96.8%

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

Alternative 4: 83.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- x (/ (* t y) a))))
   (if (<= t -6.2e+43) t_1 (if (<= t 2e+63) (fma (/ y a) z x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x - ((t * y) / a);
	double tmp;
	if (t <= -6.2e+43) {
		tmp = t_1;
	} else if (t <= 2e+63) {
		tmp = fma((y / a), z, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -6.2000000000000003e43 or 2.00000000000000012e63 < t

   1. Initial program 89.9%

      \[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. negate-sub N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 78.9

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

   4. Applied rewrites 78.9%

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

   if -6.2000000000000003e43 < t < 2.00000000000000012e63

   1. Initial program 95.6%

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

   2. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 85.9

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

   4. Applied rewrites 85.9%

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

Alternative 5: 74.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* (- t) y) a)))
   (if (<= t -1.8e+212) t_1 (if (<= t 6.8e+253) (fma (/ y a) z x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (-t * y) / a;
	double tmp;
	if (t <= -1.8e+212) {
		tmp = t_1;
	} else if (t <= 6.8e+253) {
		tmp = fma((y / a), z, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.8e212 or 6.80000000000000035e253 < t

   1. Initial program 87.8%

      \[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. +-commutative N/A

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

      6. associate-/l* N/A

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

      7. sub-div N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. sub-div N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 88.7

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

   3. Applied rewrites 88.7%

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

   4. Taylor expanded in t around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. associate-*r* N/A

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

      4. mul-1-neg N/A

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

      5. lift-neg.f64 N/A

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

      6. lower-*.f64 65.8

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

   6. Applied rewrites 65.8%

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

   if -1.8e212 < t < 6.80000000000000035e253

   1. Initial program 93.9%

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

   2. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 75.5

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

   4. Applied rewrites 75.5%

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

Alternative 6: 59.2% 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 z\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+36}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{+27}:\\ \;\;\;\;x\\ \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) z)))
   (if (<= t_1 -1e+36) t_2 (if (<= t_1 1e+27) 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 = (y / a) * z;
	double tmp;
	if (t_1 <= -1e+36) {
		tmp = t_2;
	} else if (t_1 <= 1e+27) {
		tmp = x;
	} 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) * z
    if (t_1 <= (-1d+36)) then
        tmp = t_2
    else if (t_1 <= 1d+27) then
        tmp = x
    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) * z;
	double tmp;
	if (t_1 <= -1e+36) {
		tmp = t_2;
	} else if (t_1 <= 1e+27) {
		tmp = x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y * (z - t)) / a
	t_2 = (y / a) * z
	tmp = 0
	if t_1 <= -1e+36:
		tmp = t_2
	elif t_1 <= 1e+27:
		tmp = 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(y / a) * z)
	tmp = 0.0
	if (t_1 <= -1e+36)
		tmp = t_2;
	elseif (t_1 <= 1e+27)
		tmp = x;
	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) * z;
	tmp = 0.0;
	if (t_1 <= -1e+36)
		tmp = t_2;
	elseif (t_1 <= 1e+27)
		tmp = x;
	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] * z), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+36], t$95$2, If[LessEqual[t$95$1, 1e+27], x, t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -1.00000000000000004e36 or 1e27 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 89.5%

      \[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. +-commutative N/A

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

      6. associate-/l* N/A

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

      7. sub-div N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. sub-div N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 89.2

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

   3. Applied rewrites 89.2%

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

   4. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 43.2

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

   6. Applied rewrites 43.2%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. associate-*l/ N/A

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

      5. lower-*.f64 N/A

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

      6. lift-/.f64 48.3

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

   8. Applied rewrites 48.3%

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

   if -1.00000000000000004e36 < (/.f64 (*.f64 y (-.f64 z t)) a) < 1e27

   1. Initial program 99.0%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 75.9%

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

Alternative 7: 56.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y \cdot \left(z - t\right)}{a}\\ t_2 := y \cdot \frac{z}{a}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+36}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{+27}:\\ \;\;\;\;x\\ \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 (/ z a))))
   (if (<= t_1 -1e+36) t_2 (if (<= t_1 1e+27) 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 = y * (z / a);
	double tmp;
	if (t_1 <= -1e+36) {
		tmp = t_2;
	} else if (t_1 <= 1e+27) {
		tmp = x;
	} 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 * (z / a)
    if (t_1 <= (-1d+36)) then
        tmp = t_2
    else if (t_1 <= 1d+27) then
        tmp = x
    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 * (z / a);
	double tmp;
	if (t_1 <= -1e+36) {
		tmp = t_2;
	} else if (t_1 <= 1e+27) {
		tmp = x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y * (z - t)) / a
	t_2 = y * (z / a)
	tmp = 0
	if t_1 <= -1e+36:
		tmp = t_2
	elif t_1 <= 1e+27:
		tmp = 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(y * Float64(z / a))
	tmp = 0.0
	if (t_1 <= -1e+36)
		tmp = t_2;
	elseif (t_1 <= 1e+27)
		tmp = x;
	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 * (z / a);
	tmp = 0.0;
	if (t_1 <= -1e+36)
		tmp = t_2;
	elseif (t_1 <= 1e+27)
		tmp = x;
	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[(y * N[(z / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+36], t$95$2, If[LessEqual[t$95$1, 1e+27], x, t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -1.00000000000000004e36 or 1e27 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 89.5%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 43.2

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

   4. Applied rewrites 43.2%

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

   if -1.00000000000000004e36 < (/.f64 (*.f64 y (-.f64 z t)) a) < 1e27

   1. Initial program 99.0%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 75.9%

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

Alternative 8: 39.0% accurate, 12.7× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.3%

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

2. Taylor expanded in x around inf

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

4. Applied rewrites 39.0%

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

Reproduce

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