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

Percentage Accurate: 93.6% → 95.9%

Time: 6.6s

Alternatives: 6

Speedup: 0.6×

• 25.3% 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.6% 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: 95.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y \cdot \left(z - t\right)\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\left(t - z\right) \cdot \frac{y}{a}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{t\_1}{a}\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 65.0%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

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

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

      5. lower-*.f64 N/A

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

      6. *-lft-identity N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. distribute-neg-in N/A

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

      11. mul-1-neg N/A

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

      12. remove-double-neg N/A

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

      13. mul-1-neg N/A

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

      14. *-commutative N/A

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

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

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

      16. mul-1-neg N/A

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

      17. *-commutative N/A

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

      18. associate-*l* N/A

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

      19. metadata-eval N/A

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

      20. *-rgt-identity N/A

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

      21. lower--.f64 N/A

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

      22. lower-/.f64 96.5

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

   5. Applied rewrites 96.5%

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

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

   1. Initial program 97.8%

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

Alternative 2: 86.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y \cdot \left(z - t\right)}{a}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+166} \lor \neg \left(t\_1 \leq 2 \cdot 10^{+130}\right):\\ \;\;\;\;\left(t - z\right) \cdot \frac{y}{a}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{z \cdot y}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y (- z t)) a)))
   (if (or (<= t_1 -1e+166) (not (<= t_1 2e+130)))
     (* (- t z) (/ y a))
     (- x (/ (* z y) a)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / a;
	double tmp;
	if ((t_1 <= -1e+166) || !(t_1 <= 2e+130)) {
		tmp = (t - z) * (y / a);
	} else {
		tmp = x - ((z * y) / a);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (y * (z - t)) / a
    if ((t_1 <= (-1d+166)) .or. (.not. (t_1 <= 2d+130))) then
        tmp = (t - z) * (y / a)
    else
        tmp = x - ((z * y) / a)
    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 tmp;
	if ((t_1 <= -1e+166) || !(t_1 <= 2e+130)) {
		tmp = (t - z) * (y / a);
	} else {
		tmp = x - ((z * y) / a);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y * (z - t)) / a
	tmp = 0
	if (t_1 <= -1e+166) or not (t_1 <= 2e+130):
		tmp = (t - z) * (y / a)
	else:
		tmp = x - ((z * y) / a)
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y * Float64(z - t)) / a)
	tmp = 0.0
	if ((t_1 <= -1e+166) || !(t_1 <= 2e+130))
		tmp = Float64(Float64(t - z) * Float64(y / a));
	else
		tmp = Float64(x - Float64(Float64(z * y) / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y * (z - t)) / a;
	tmp = 0.0;
	if ((t_1 <= -1e+166) || ~((t_1 <= 2e+130)))
		tmp = (t - z) * (y / a);
	else
		tmp = x - ((z * y) / a);
	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]}, If[Or[LessEqual[t$95$1, -1e+166], N[Not[LessEqual[t$95$1, 2e+130]], $MachinePrecision]], N[(N[(t - z), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[(z * y), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -9.9999999999999994e165 or 2.0000000000000001e130 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 87.7%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

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

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

      5. lower-*.f64 N/A

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

      6. *-lft-identity N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. distribute-neg-in N/A

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

      11. mul-1-neg N/A

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

      12. remove-double-neg N/A

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

      13. mul-1-neg N/A

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

      14. *-commutative N/A

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

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

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

      16. mul-1-neg N/A

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

      17. *-commutative N/A

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

      18. associate-*l* N/A

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

      19. metadata-eval N/A

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

      20. *-rgt-identity N/A

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

      21. lower--.f64 N/A

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

      22. lower-/.f64 93.8

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

   5. Applied rewrites 93.8%

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

   if -9.9999999999999994e165 < (/.f64 (*.f64 y (-.f64 z t)) a) < 2.0000000000000001e130

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 87.8

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

   5. Applied rewrites 87.8%

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

4. Final simplification 90.6%

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

Alternative 3: 86.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y \cdot \left(z - t\right)}{a}\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+73} \lor \neg \left(t\_1 \leq 2 \cdot 10^{+57}\right):\\ \;\;\;\;\left(t - 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
 (let* ((t_1 (/ (* y (- z t)) a)))
   (if (or (<= t_1 -5e+73) (not (<= t_1 2e+57)))
     (* (- t z) (/ y a))
     (fma (/ t a) y x))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / a;
	double tmp;
	if ((t_1 <= -5e+73) || !(t_1 <= 2e+57)) {
		tmp = (t - z) * (y / a);
	} else {
		tmp = fma((t / a), y, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y * Float64(z - t)) / a)
	tmp = 0.0
	if ((t_1 <= -5e+73) || !(t_1 <= 2e+57))
		tmp = Float64(Float64(t - z) * Float64(y / a));
	else
		tmp = fma(Float64(t / a), y, x);
	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]}, If[Or[LessEqual[t$95$1, -5e+73], N[Not[LessEqual[t$95$1, 2e+57]], $MachinePrecision]], N[(N[(t - z), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision], N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -4.99999999999999976e73 or 2.0000000000000001e57 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 89.6%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

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

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

      5. lower-*.f64 N/A

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

      6. *-lft-identity N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. distribute-neg-in N/A

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

      11. mul-1-neg N/A

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

      12. remove-double-neg N/A

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

      13. mul-1-neg N/A

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

      14. *-commutative N/A

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

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

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

      16. mul-1-neg N/A

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

      17. *-commutative N/A

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

      18. associate-*l* N/A

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

      19. metadata-eval N/A

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

      20. *-rgt-identity N/A

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

      21. lower--.f64 N/A

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

      22. lower-/.f64 88.7

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

   5. Applied rewrites 88.7%

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

   if -4.99999999999999976e73 < (/.f64 (*.f64 y (-.f64 z t)) a) < 2.0000000000000001e57

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. +-commutative N/A

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

      5. associate-*l/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 88.8

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

   5. Applied rewrites 88.8%

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

4. Final simplification 88.8%

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

Alternative 4: 71.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.7 \cdot 10^{+184}:\\ \;\;\;\;\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 -4.7e+184) (* (- 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 <= -4.7e+184) {
		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 <= -4.7e+184)
		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, -4.7e+184], 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 < -4.7000000000000003e184

   1. Initial program 91.9%

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

   3. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

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

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

      5. lower-*.f64 N/A

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

      6. distribute-neg-frac N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 60.8

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

   5. Applied rewrites 60.8%

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

   7. Applied rewrites 75.2%

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

   if -4.7000000000000003e184 < z

   1. Initial program 94.3%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. +-commutative N/A

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

      5. associate-*l/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 77.2

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

   5. Applied rewrites 77.2%

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

Alternative 5: 68.3% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 94.1%

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

3. Taylor expanded in z around 0

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

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

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

   2. metadata-eval N/A

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

   3. *-lft-identity N/A

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

   4. +-commutative N/A

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

   5. associate-*l/ N/A

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

   6. lower-fma.f64 N/A

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

   7. lower-/.f64 72.9

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

5. Applied rewrites 72.9%

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

Alternative 6: 34.5% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.1%

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

3. Taylor expanded in t around inf

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

   1. associate-*l/ N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 34.1

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

5. Applied rewrites 34.1%

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

7. Applied rewrites 36.6%

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

Developer Target 1: 99.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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