Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, B

Percentage Accurate: 69.1% → 99.7%

Time: 6.5s

Alternatives: 9

Speedup: 2.5×

Specification

Math

\[\begin{array}{l} \\ x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+
  x
  (/
   (*
    y
    (+
     (* (+ (* z 0.0692910599291889) 0.4917317610505968) z)
     0.279195317918525))
   (+ (* (+ z 6.012459259764103) z) 3.350343815022304))))

C

double code(double x, double y, double z) {
	return x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304));
}

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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + ((y * ((((z * 0.0692910599291889d0) + 0.4917317610505968d0) * z) + 0.279195317918525d0)) / (((z + 6.012459259764103d0) * z) + 3.350343815022304d0))
end function

Java

public static double code(double x, double y, double z) {
	return x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304));
}

Python

def code(x, y, z):
	return x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304))

Julia

function code(x, y, z)
	return Float64(x + Float64(Float64(y * Float64(Float64(Float64(Float64(z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / Float64(Float64(Float64(z + 6.012459259764103) * z) + 3.350343815022304)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304));
end

Wolfram

code[x_, y_, z_] := N[(x + N[(N[(y * N[(N[(N[(N[(z * 0.0692910599291889), $MachinePrecision] + 0.4917317610505968), $MachinePrecision] * z), $MachinePrecision] + 0.279195317918525), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(z + 6.012459259764103), $MachinePrecision] * z), $MachinePrecision] + 3.350343815022304), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 69.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+
  x
  (/
   (*
    y
    (+
     (* (+ (* z 0.0692910599291889) 0.4917317610505968) z)
     0.279195317918525))
   (+ (* (+ z 6.012459259764103) z) 3.350343815022304))))

C

double code(double x, double y, double z) {
	return x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304));
}

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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + ((y * ((((z * 0.0692910599291889d0) + 0.4917317610505968d0) * z) + 0.279195317918525d0)) / (((z + 6.012459259764103d0) * z) + 3.350343815022304d0))
end function

Java

public static double code(double x, double y, double z) {
	return x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304));
}

Python

def code(x, y, z):
	return x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304))

Julia

function code(x, y, z)
	return Float64(x + Float64(Float64(y * Float64(Float64(Float64(Float64(z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / Float64(Float64(Float64(z + 6.012459259764103) * z) + 3.350343815022304)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304));
end

Wolfram

code[x_, y_, z_] := N[(x + N[(N[(y * N[(N[(N[(N[(z * 0.0692910599291889), $MachinePrecision] + 0.4917317610505968), $MachinePrecision] * z), $MachinePrecision] + 0.279195317918525), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(z + 6.012459259764103), $MachinePrecision] * z), $MachinePrecision] + 3.350343815022304), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\frac{\mathsf{fma}\left(\mathsf{fma}\left(0.0692910599291889, z, 0.4917317610505968\right), z, 0.279195317918525\right)}{\mathsf{fma}\left(6.012459259764103 + z, z, 3.350343815022304\right)}, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;x + 0.0692910599291889 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<=
      (+
       x
       (/
        (*
         y
         (+
          (* (+ (* z 0.0692910599291889) 0.4917317610505968) z)
          0.279195317918525))
        (+ (* (+ z 6.012459259764103) z) 3.350343815022304)))
      INFINITY)
   (fma
    (/
     (fma (fma 0.0692910599291889 z 0.4917317610505968) z 0.279195317918525)
     (fma (+ 6.012459259764103 z) z 3.350343815022304))
    y
    x)
   (+ x (* 0.0692910599291889 y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304))) <= ((double) INFINITY)) {
		tmp = fma((fma(fma(0.0692910599291889, z, 0.4917317610505968), z, 0.279195317918525) / fma((6.012459259764103 + z), z, 3.350343815022304)), y, x);
	} else {
		tmp = x + (0.0692910599291889 * y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(x + Float64(Float64(y * Float64(Float64(Float64(Float64(z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / Float64(Float64(Float64(z + 6.012459259764103) * z) + 3.350343815022304))) <= Inf)
		tmp = fma(Float64(fma(fma(0.0692910599291889, z, 0.4917317610505968), z, 0.279195317918525) / fma(Float64(6.012459259764103 + z), z, 3.350343815022304)), y, x);
	else
		tmp = Float64(x + Float64(0.0692910599291889 * y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(x + N[(N[(y * N[(N[(N[(N[(z * 0.0692910599291889), $MachinePrecision] + 0.4917317610505968), $MachinePrecision] * z), $MachinePrecision] + 0.279195317918525), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(z + 6.012459259764103), $MachinePrecision] * z), $MachinePrecision] + 3.350343815022304), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(N[(0.0692910599291889 * z + 0.4917317610505968), $MachinePrecision] * z + 0.279195317918525), $MachinePrecision] / N[(N[(6.012459259764103 + z), $MachinePrecision] * z + 3.350343815022304), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision], N[(x + N[(0.0692910599291889 * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64)))) < +inf.0

   1. Initial program 92.1%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   4. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\mathsf{fma}\left(\mathsf{fma}\left(0.0692910599291889, z, 0.4917317610505968\right), z, 0.279195317918525\right)}{\mathsf{fma}\left(6.012459259764103 + z, z, 3.350343815022304\right)}, y, x\right)} \]

   if +inf.0 < (+.f64 x (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64))))

   1. Initial program 0.0%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 99.5

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

   5. Applied rewrites 99.5%

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

Alternative 2: 84.1% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304}\\ \mathbf{if}\;t\_0 \leq -\infty \lor \neg \left(t\_0 \leq -5 \cdot 10^{+52} \lor \neg \left(t\_0 \leq 5 \cdot 10^{+44} \lor \neg \left(t\_0 \leq 2 \cdot 10^{+295}\right)\right)\right):\\ \;\;\;\;\mathsf{fma}\left(0.0692910599291889, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;0.08333333333333323 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0
         (/
          (*
           y
           (+
            (* (+ (* z 0.0692910599291889) 0.4917317610505968) z)
            0.279195317918525))
          (+ (* (+ z 6.012459259764103) z) 3.350343815022304))))
   (if (or (<= t_0 (- INFINITY))
           (not
            (or (<= t_0 -5e+52)
                (not (or (<= t_0 5e+44) (not (<= t_0 2e+295)))))))
     (fma 0.0692910599291889 y x)
     (* 0.08333333333333323 y))))

C

double code(double x, double y, double z) {
	double t_0 = (y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304);
	double tmp;
	if ((t_0 <= -((double) INFINITY)) || !((t_0 <= -5e+52) || !((t_0 <= 5e+44) || !(t_0 <= 2e+295)))) {
		tmp = fma(0.0692910599291889, y, x);
	} else {
		tmp = 0.08333333333333323 * y;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(y * Float64(Float64(Float64(Float64(z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / Float64(Float64(Float64(z + 6.012459259764103) * z) + 3.350343815022304))
	tmp = 0.0
	if ((t_0 <= Float64(-Inf)) || !((t_0 <= -5e+52) || !((t_0 <= 5e+44) || !(t_0 <= 2e+295))))
		tmp = fma(0.0692910599291889, y, x);
	else
		tmp = Float64(0.08333333333333323 * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y * N[(N[(N[(N[(z * 0.0692910599291889), $MachinePrecision] + 0.4917317610505968), $MachinePrecision] * z), $MachinePrecision] + 0.279195317918525), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(z + 6.012459259764103), $MachinePrecision] * z), $MachinePrecision] + 3.350343815022304), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, (-Infinity)], N[Not[Or[LessEqual[t$95$0, -5e+52], N[Not[Or[LessEqual[t$95$0, 5e+44], N[Not[LessEqual[t$95$0, 2e+295]], $MachinePrecision]]], $MachinePrecision]]], $MachinePrecision]], N[(0.0692910599291889 * y + x), $MachinePrecision], N[(0.08333333333333323 * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64))) < -inf.0 or -5e52 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64))) < 4.9999999999999996e44 or 2e295 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64)))

   1. Initial program 51.8%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

         \[\leadsto \frac{692910599291889}{10000000000000000} \cdot y + \color{blue}{x} \]

      2. lower-fma.f64 90.6

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

   5. Applied rewrites 90.6%

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

   if -inf.0 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64))) < -5e52 or 4.9999999999999996e44 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64))) < 2e295

   1. Initial program 99.3%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{279195317918525}{3350343815022304} \cdot y + \color{blue}{x} \]

      2. lower-fma.f64 91.2

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

   5. Applied rewrites 91.2%

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

   6. Taylor expanded in x around 0

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

      1. lower-*.f64 82.0

         \[\leadsto 0.08333333333333323 \cdot y \]

   8. Applied rewrites 82.0%

      \[\leadsto 0.08333333333333323 \cdot \color{blue}{y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 88.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \leq -\infty \lor \neg \left(\frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \leq -5 \cdot 10^{+52} \lor \neg \left(\frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \leq 5 \cdot 10^{+44} \lor \neg \left(\frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \leq 2 \cdot 10^{+295}\right)\right)\right):\\ \;\;\;\;\mathsf{fma}\left(0.0692910599291889, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;0.08333333333333323 \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 64.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304}\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;0.0692910599291889 \cdot y\\ \mathbf{elif}\;t\_0 \leq -1000000000000:\\ \;\;\;\;0.08333333333333323 \cdot y\\ \mathbf{elif}\;t\_0 \leq 10^{-58}:\\ \;\;\;\;x\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+295}:\\ \;\;\;\;0.08333333333333323 \cdot y\\ \mathbf{else}:\\ \;\;\;\;0.0692910599291889 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0
         (/
          (*
           y
           (+
            (* (+ (* z 0.0692910599291889) 0.4917317610505968) z)
            0.279195317918525))
          (+ (* (+ z 6.012459259764103) z) 3.350343815022304))))
   (if (<= t_0 (- INFINITY))
     (* 0.0692910599291889 y)
     (if (<= t_0 -1000000000000.0)
       (* 0.08333333333333323 y)
       (if (<= t_0 1e-58)
         x
         (if (<= t_0 2e+295)
           (* 0.08333333333333323 y)
           (* 0.0692910599291889 y)))))))

C

double code(double x, double y, double z) {
	double t_0 = (y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = 0.0692910599291889 * y;
	} else if (t_0 <= -1000000000000.0) {
		tmp = 0.08333333333333323 * y;
	} else if (t_0 <= 1e-58) {
		tmp = x;
	} else if (t_0 <= 2e+295) {
		tmp = 0.08333333333333323 * y;
	} else {
		tmp = 0.0692910599291889 * y;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = (y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304);
	double tmp;
	if (t_0 <= -Double.POSITIVE_INFINITY) {
		tmp = 0.0692910599291889 * y;
	} else if (t_0 <= -1000000000000.0) {
		tmp = 0.08333333333333323 * y;
	} else if (t_0 <= 1e-58) {
		tmp = x;
	} else if (t_0 <= 2e+295) {
		tmp = 0.08333333333333323 * y;
	} else {
		tmp = 0.0692910599291889 * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304)
	tmp = 0
	if t_0 <= -math.inf:
		tmp = 0.0692910599291889 * y
	elif t_0 <= -1000000000000.0:
		tmp = 0.08333333333333323 * y
	elif t_0 <= 1e-58:
		tmp = x
	elif t_0 <= 2e+295:
		tmp = 0.08333333333333323 * y
	else:
		tmp = 0.0692910599291889 * y
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(y * Float64(Float64(Float64(Float64(z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / Float64(Float64(Float64(z + 6.012459259764103) * z) + 3.350343815022304))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(0.0692910599291889 * y);
	elseif (t_0 <= -1000000000000.0)
		tmp = Float64(0.08333333333333323 * y);
	elseif (t_0 <= 1e-58)
		tmp = x;
	elseif (t_0 <= 2e+295)
		tmp = Float64(0.08333333333333323 * y);
	else
		tmp = Float64(0.0692910599291889 * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) / (((z + 6.012459259764103) * z) + 3.350343815022304);
	tmp = 0.0;
	if (t_0 <= -Inf)
		tmp = 0.0692910599291889 * y;
	elseif (t_0 <= -1000000000000.0)
		tmp = 0.08333333333333323 * y;
	elseif (t_0 <= 1e-58)
		tmp = x;
	elseif (t_0 <= 2e+295)
		tmp = 0.08333333333333323 * y;
	else
		tmp = 0.0692910599291889 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y * N[(N[(N[(N[(z * 0.0692910599291889), $MachinePrecision] + 0.4917317610505968), $MachinePrecision] * z), $MachinePrecision] + 0.279195317918525), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(z + 6.012459259764103), $MachinePrecision] * z), $MachinePrecision] + 3.350343815022304), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(0.0692910599291889 * y), $MachinePrecision], If[LessEqual[t$95$0, -1000000000000.0], N[(0.08333333333333323 * y), $MachinePrecision], If[LessEqual[t$95$0, 1e-58], x, If[LessEqual[t$95$0, 2e+295], N[(0.08333333333333323 * y), $MachinePrecision], N[(0.0692910599291889 * y), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64))) < -inf.0 or 2e295 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64)))

   1. Initial program 0.8%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

         \[\leadsto \frac{692910599291889}{10000000000000000} \cdot y + \color{blue}{x} \]

      2. lower-fma.f64 99.0

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

   5. Applied rewrites 99.0%

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

   6. Taylor expanded in x around 0

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

      1. lower-*.f64 58.9

         \[\leadsto 0.0692910599291889 \cdot y \]

   8. Applied rewrites 58.9%

      \[\leadsto 0.0692910599291889 \cdot \color{blue}{y} \]

   if -inf.0 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64))) < -1e12 or 1e-58 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64))) < 2e295

   1. Initial program 99.4%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{279195317918525}{3350343815022304} \cdot y + \color{blue}{x} \]

      2. lower-fma.f64 88.5

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

   5. Applied rewrites 88.5%

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

   6. Taylor expanded in x around 0

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

      1. lower-*.f64 72.3

         \[\leadsto 0.08333333333333323 \cdot y \]

   8. Applied rewrites 72.3%

      \[\leadsto 0.08333333333333323 \cdot \color{blue}{y} \]

   if -1e12 < (/.f64 (*.f64 y (+.f64 (*.f64 (+.f64 (*.f64 z #s(literal 692910599291889/10000000000000000 binary64)) #s(literal 307332350656623/625000000000000 binary64)) z) #s(literal 11167812716741/40000000000000 binary64))) (+.f64 (*.f64 (+.f64 z #s(literal 6012459259764103/1000000000000000 binary64)) z) #s(literal 104698244219447/31250000000000 binary64))) < 1e-58

   1. Initial program 99.7%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 76.1%

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

Alternative 4: 98.9% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1350000000 \lor \neg \left(z \leq 9 \cdot 10^{-9}\right):\\ \;\;\;\;\left(\frac{0.07512208616047561}{z} + 0.0692910599291889\right) \cdot y + x\\ \mathbf{else}:\\ \;\;\;\;x + \mathsf{fma}\left(y \cdot -0.00277777777751721, z, 0.08333333333333323 \cdot y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1350000000.0) (not (<= z 9e-9)))
   (+ (* (+ (/ 0.07512208616047561 z) 0.0692910599291889) y) x)
   (+ x (fma (* y -0.00277777777751721) z (* 0.08333333333333323 y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1350000000.0) || !(z <= 9e-9)) {
		tmp = (((0.07512208616047561 / z) + 0.0692910599291889) * y) + x;
	} else {
		tmp = x + fma((y * -0.00277777777751721), z, (0.08333333333333323 * y));
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1350000000.0) || !(z <= 9e-9))
		tmp = Float64(Float64(Float64(Float64(0.07512208616047561 / z) + 0.0692910599291889) * y) + x);
	else
		tmp = Float64(x + fma(Float64(y * -0.00277777777751721), z, Float64(0.08333333333333323 * y)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1350000000.0], N[Not[LessEqual[z, 9e-9]], $MachinePrecision]], N[(N[(N[(N[(0.07512208616047561 / z), $MachinePrecision] + 0.0692910599291889), $MachinePrecision] * y), $MachinePrecision] + x), $MachinePrecision], N[(x + N[(N[(y * -0.00277777777751721), $MachinePrecision] * z + N[(0.08333333333333323 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.35e9 or 8.99999999999999953e-9 < z

   1. Initial program 31.0%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

      \[\leadsto x + \color{blue}{\left(\left(\frac{692910599291889}{10000000000000000} \cdot y + \frac{307332350656623}{625000000000000} \cdot \frac{y}{z}\right) - \frac{4166096748901211929300981260567}{10000000000000000000000000000000} \cdot \frac{y}{z}\right)} \]
   4. Step-by-step derivation

      1. associate--l+ N/A

         \[\leadsto x + \left(\frac{692910599291889}{10000000000000000} \cdot y + \color{blue}{\left(\frac{307332350656623}{625000000000000} \cdot \frac{y}{z} - \frac{4166096748901211929300981260567}{10000000000000000000000000000000} \cdot \frac{y}{z}\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x + \mathsf{fma}\left(\frac{692910599291889}{10000000000000000}, \color{blue}{y}, \frac{307332350656623}{625000000000000} \cdot \frac{y}{z} - \frac{4166096748901211929300981260567}{10000000000000000000000000000000} \cdot \frac{y}{z}\right) \]

      3. associate-*r/ N/A

         \[\leadsto x + \mathsf{fma}\left(\frac{692910599291889}{10000000000000000}, y, \frac{\frac{307332350656623}{625000000000000} \cdot y}{z} - \frac{4166096748901211929300981260567}{10000000000000000000000000000000} \cdot \frac{y}{z}\right) \]

      4. associate-*r/ N/A

         \[\leadsto x + \mathsf{fma}\left(\frac{692910599291889}{10000000000000000}, y, \frac{\frac{307332350656623}{625000000000000} \cdot y}{z} - \frac{\frac{4166096748901211929300981260567}{10000000000000000000000000000000} \cdot y}{z}\right) \]

      5. sub-div N/A

         \[\leadsto x + \mathsf{fma}\left(\frac{692910599291889}{10000000000000000}, y, \frac{\frac{307332350656623}{625000000000000} \cdot y - \frac{4166096748901211929300981260567}{10000000000000000000000000000000} \cdot y}{z}\right) \]

      6. lower-/.f64 N/A

         \[\leadsto x + \mathsf{fma}\left(\frac{692910599291889}{10000000000000000}, y, \frac{\frac{307332350656623}{625000000000000} \cdot y - \frac{4166096748901211929300981260567}{10000000000000000000000000000000} \cdot y}{z}\right) \]

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

         \[\leadsto x + \mathsf{fma}\left(\frac{692910599291889}{10000000000000000}, y, \frac{y \cdot \left(\frac{307332350656623}{625000000000000} - \frac{4166096748901211929300981260567}{10000000000000000000000000000000}\right)}{z}\right) \]

      8. lower-*.f64 N/A

         \[\leadsto x + \mathsf{fma}\left(\frac{692910599291889}{10000000000000000}, y, \frac{y \cdot \left(\frac{307332350656623}{625000000000000} - \frac{4166096748901211929300981260567}{10000000000000000000000000000000}\right)}{z}\right) \]

      9. metadata-eval 98.6

         \[\leadsto x + \mathsf{fma}\left(0.0692910599291889, y, \frac{y \cdot 0.07512208616047561}{z}\right) \]

   5. Applied rewrites 98.6%

      \[\leadsto x + \color{blue}{\mathsf{fma}\left(0.0692910599291889, y, \frac{y \cdot 0.07512208616047561}{z}\right)} \]
   6. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x + \mathsf{fma}\left(\frac{692910599291889}{10000000000000000}, y, \frac{y \cdot \frac{751220861604756070699018739433}{10000000000000000000000000000000}}{z}\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{692910599291889}{10000000000000000}, y, \frac{y \cdot \frac{751220861604756070699018739433}{10000000000000000000000000000000}}{z}\right) + x} \]

      3. lower-+.f64 98.6

         \[\leadsto \color{blue}{\mathsf{fma}\left(0.0692910599291889, y, \frac{y \cdot 0.07512208616047561}{z}\right) + x} \]

   7. Applied rewrites 98.6%

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

   if -1.35e9 < z < 8.99999999999999953e-9

   1. Initial program 99.6%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto x + \color{blue}{\left(\frac{279195317918525}{3350343815022304} \cdot y + z \cdot \left(\frac{307332350656623}{2093964884388940} \cdot y - \frac{1678650474502018223880473708075}{11224803678858206361900017468416} \cdot y\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto x + \left(z \cdot \left(\frac{307332350656623}{2093964884388940} \cdot y - \frac{1678650474502018223880473708075}{11224803678858206361900017468416} \cdot y\right) + \color{blue}{\frac{279195317918525}{3350343815022304} \cdot y}\right) \]

      2. *-commutative N/A

         \[\leadsto x + \left(\left(\frac{307332350656623}{2093964884388940} \cdot y - \frac{1678650474502018223880473708075}{11224803678858206361900017468416} \cdot y\right) \cdot z + \color{blue}{\frac{279195317918525}{3350343815022304}} \cdot y\right) \]

      3. lower-fma.f64 N/A

         \[\leadsto x + \mathsf{fma}\left(\frac{307332350656623}{2093964884388940} \cdot y - \frac{1678650474502018223880473708075}{11224803678858206361900017468416} \cdot y, \color{blue}{z}, \frac{279195317918525}{3350343815022304} \cdot y\right) \]

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

         \[\leadsto x + \mathsf{fma}\left(y \cdot \left(\frac{307332350656623}{2093964884388940} - \frac{1678650474502018223880473708075}{11224803678858206361900017468416}\right), z, \frac{279195317918525}{3350343815022304} \cdot y\right) \]

      5. lower-*.f64 N/A

         \[\leadsto x + \mathsf{fma}\left(y \cdot \left(\frac{307332350656623}{2093964884388940} - \frac{1678650474502018223880473708075}{11224803678858206361900017468416}\right), z, \frac{279195317918525}{3350343815022304} \cdot y\right) \]

      6. metadata-eval N/A

         \[\leadsto x + \mathsf{fma}\left(y \cdot \frac{-155900051080628738716045985239}{56124018394291031809500087342080}, z, \frac{279195317918525}{3350343815022304} \cdot y\right) \]

      7. lower-*.f64 99.8

         \[\leadsto x + \mathsf{fma}\left(y \cdot -0.00277777777751721, z, 0.08333333333333323 \cdot y\right) \]

   5. Applied rewrites 99.8%

      \[\leadsto x + \color{blue}{\mathsf{fma}\left(y \cdot -0.00277777777751721, z, 0.08333333333333323 \cdot y\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1350000000 \lor \neg \left(z \leq 9 \cdot 10^{-9}\right):\\ \;\;\;\;\left(\frac{0.07512208616047561}{z} + 0.0692910599291889\right) \cdot y + x\\ \mathbf{else}:\\ \;\;\;\;x + \mathsf{fma}\left(y \cdot -0.00277777777751721, z, 0.08333333333333323 \cdot y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.8% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1350000000:\\ \;\;\;\;x + 0.0692910599291889 \cdot y\\ \mathbf{elif}\;z \leq 9 \cdot 10^{-9}:\\ \;\;\;\;x + \mathsf{fma}\left(y \cdot -0.00277777777751721, z, 0.08333333333333323 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.0692910599291889, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1350000000.0)
   (+ x (* 0.0692910599291889 y))
   (if (<= z 9e-9)
     (+ x (fma (* y -0.00277777777751721) z (* 0.08333333333333323 y)))
     (fma 0.0692910599291889 y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1350000000.0) {
		tmp = x + (0.0692910599291889 * y);
	} else if (z <= 9e-9) {
		tmp = x + fma((y * -0.00277777777751721), z, (0.08333333333333323 * y));
	} else {
		tmp = fma(0.0692910599291889, y, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1350000000.0)
		tmp = Float64(x + Float64(0.0692910599291889 * y));
	elseif (z <= 9e-9)
		tmp = Float64(x + fma(Float64(y * -0.00277777777751721), z, Float64(0.08333333333333323 * y)));
	else
		tmp = fma(0.0692910599291889, y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1350000000.0], N[(x + N[(0.0692910599291889 * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9e-9], N[(x + N[(N[(y * -0.00277777777751721), $MachinePrecision] * z + N[(0.08333333333333323 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.0692910599291889 * y + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.35e9

   1. Initial program 30.0%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if -1.35e9 < z < 8.99999999999999953e-9

   1. Initial program 99.6%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto x + \color{blue}{\left(\frac{279195317918525}{3350343815022304} \cdot y + z \cdot \left(\frac{307332350656623}{2093964884388940} \cdot y - \frac{1678650474502018223880473708075}{11224803678858206361900017468416} \cdot y\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto x + \left(z \cdot \left(\frac{307332350656623}{2093964884388940} \cdot y - \frac{1678650474502018223880473708075}{11224803678858206361900017468416} \cdot y\right) + \color{blue}{\frac{279195317918525}{3350343815022304} \cdot y}\right) \]

      2. *-commutative N/A

         \[\leadsto x + \left(\left(\frac{307332350656623}{2093964884388940} \cdot y - \frac{1678650474502018223880473708075}{11224803678858206361900017468416} \cdot y\right) \cdot z + \color{blue}{\frac{279195317918525}{3350343815022304}} \cdot y\right) \]

      3. lower-fma.f64 N/A

         \[\leadsto x + \mathsf{fma}\left(\frac{307332350656623}{2093964884388940} \cdot y - \frac{1678650474502018223880473708075}{11224803678858206361900017468416} \cdot y, \color{blue}{z}, \frac{279195317918525}{3350343815022304} \cdot y\right) \]

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

         \[\leadsto x + \mathsf{fma}\left(y \cdot \left(\frac{307332350656623}{2093964884388940} - \frac{1678650474502018223880473708075}{11224803678858206361900017468416}\right), z, \frac{279195317918525}{3350343815022304} \cdot y\right) \]

      5. lower-*.f64 N/A

         \[\leadsto x + \mathsf{fma}\left(y \cdot \left(\frac{307332350656623}{2093964884388940} - \frac{1678650474502018223880473708075}{11224803678858206361900017468416}\right), z, \frac{279195317918525}{3350343815022304} \cdot y\right) \]

      6. metadata-eval N/A

         \[\leadsto x + \mathsf{fma}\left(y \cdot \frac{-155900051080628738716045985239}{56124018394291031809500087342080}, z, \frac{279195317918525}{3350343815022304} \cdot y\right) \]

      7. lower-*.f64 99.8

         \[\leadsto x + \mathsf{fma}\left(y \cdot -0.00277777777751721, z, 0.08333333333333323 \cdot y\right) \]

   5. Applied rewrites 99.8%

      \[\leadsto x + \color{blue}{\mathsf{fma}\left(y \cdot -0.00277777777751721, z, 0.08333333333333323 \cdot y\right)} \]

   if 8.99999999999999953e-9 < z

   1. Initial program 31.7%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

         \[\leadsto \frac{692910599291889}{10000000000000000} \cdot y + \color{blue}{x} \]

      2. lower-fma.f64 96.7

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

   5. Applied rewrites 96.7%

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

Alternative 6: 98.7% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1350000000 \lor \neg \left(z \leq 9 \cdot 10^{-9}\right):\\ \;\;\;\;\mathsf{fma}\left(0.0692910599291889, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.08333333333333323, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1350000000.0) (not (<= z 9e-9)))
   (fma 0.0692910599291889 y x)
   (fma 0.08333333333333323 y x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1350000000.0) || !(z <= 9e-9)) {
		tmp = fma(0.0692910599291889, y, x);
	} else {
		tmp = fma(0.08333333333333323, y, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1350000000.0) || !(z <= 9e-9))
		tmp = fma(0.0692910599291889, y, x);
	else
		tmp = fma(0.08333333333333323, y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1350000000.0], N[Not[LessEqual[z, 9e-9]], $MachinePrecision]], N[(0.0692910599291889 * y + x), $MachinePrecision], N[(0.08333333333333323 * y + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.35e9 or 8.99999999999999953e-9 < z

   1. Initial program 31.0%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

         \[\leadsto \frac{692910599291889}{10000000000000000} \cdot y + \color{blue}{x} \]

      2. lower-fma.f64 97.8

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

   5. Applied rewrites 97.8%

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

   if -1.35e9 < z < 8.99999999999999953e-9

   1. Initial program 99.6%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{279195317918525}{3350343815022304} \cdot y + \color{blue}{x} \]

      2. lower-fma.f64 99.8

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

   5. Applied rewrites 99.8%

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

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1350000000 \lor \neg \left(z \leq 9 \cdot 10^{-9}\right):\\ \;\;\;\;\mathsf{fma}\left(0.0692910599291889, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.08333333333333323, y, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 98.7% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1350000000:\\ \;\;\;\;x + 0.0692910599291889 \cdot y\\ \mathbf{elif}\;z \leq 9 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(0.08333333333333323, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.0692910599291889, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1350000000.0)
   (+ x (* 0.0692910599291889 y))
   (if (<= z 9e-9)
     (fma 0.08333333333333323 y x)
     (fma 0.0692910599291889 y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1350000000.0) {
		tmp = x + (0.0692910599291889 * y);
	} else if (z <= 9e-9) {
		tmp = fma(0.08333333333333323, y, x);
	} else {
		tmp = fma(0.0692910599291889, y, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1350000000.0)
		tmp = Float64(x + Float64(0.0692910599291889 * y));
	elseif (z <= 9e-9)
		tmp = fma(0.08333333333333323, y, x);
	else
		tmp = fma(0.0692910599291889, y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1350000000.0], N[(x + N[(0.0692910599291889 * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9e-9], N[(0.08333333333333323 * y + x), $MachinePrecision], N[(0.0692910599291889 * y + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.35e9

   1. Initial program 30.0%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if -1.35e9 < z < 8.99999999999999953e-9

   1. Initial program 99.6%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{279195317918525}{3350343815022304} \cdot y + \color{blue}{x} \]

      2. lower-fma.f64 99.8

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

   5. Applied rewrites 99.8%

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

   if 8.99999999999999953e-9 < z

   1. Initial program 31.7%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

         \[\leadsto \frac{692910599291889}{10000000000000000} \cdot y + \color{blue}{x} \]

      2. lower-fma.f64 96.7

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

   5. Applied rewrites 96.7%

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

Alternative 8: 61.0% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5800000000000 \lor \neg \left(y \leq 4.2 \cdot 10^{+96}\right):\\ \;\;\;\;0.0692910599291889 \cdot y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -5800000000000.0) (not (<= y 4.2e+96)))
   (* 0.0692910599291889 y)
   x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5800000000000.0) || !(y <= 4.2e+96)) {
		tmp = 0.0692910599291889 * y;
	} else {
		tmp = x;
	}
	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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-5800000000000.0d0)) .or. (.not. (y <= 4.2d+96))) then
        tmp = 0.0692910599291889d0 * y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5800000000000.0) || !(y <= 4.2e+96)) {
		tmp = 0.0692910599291889 * y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -5800000000000.0) or not (y <= 4.2e+96):
		tmp = 0.0692910599291889 * y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -5800000000000.0) || !(y <= 4.2e+96))
		tmp = Float64(0.0692910599291889 * y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -5800000000000.0) || ~((y <= 4.2e+96)))
		tmp = 0.0692910599291889 * y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -5800000000000.0], N[Not[LessEqual[y, 4.2e+96]], $MachinePrecision]], N[(0.0692910599291889 * y), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -5.8e12 or 4.2000000000000002e96 < y

   1. Initial program 57.6%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

         \[\leadsto \frac{692910599291889}{10000000000000000} \cdot y + \color{blue}{x} \]

      2. lower-fma.f64 64.6

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

   5. Applied rewrites 64.6%

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

   6. Taylor expanded in x around 0

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

      1. lower-*.f64 54.6

         \[\leadsto 0.0692910599291889 \cdot y \]

   8. Applied rewrites 54.6%

      \[\leadsto 0.0692910599291889 \cdot \color{blue}{y} \]

   if -5.8e12 < y < 4.2000000000000002e96

   1. Initial program 68.6%

      \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 68.9%

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

4. Final simplification 62.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5800000000000 \lor \neg \left(y \leq 4.2 \cdot 10^{+96}\right):\\ \;\;\;\;0.0692910599291889 \cdot y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 51.7% accurate, 47.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 63.7%

   \[x + \frac{y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

5. Applied rewrites 43.1%

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

Developer Target 1: 99.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\frac{0.07512208616047561}{z} + 0.0692910599291889\right) \cdot y - \left(\frac{0.40462203869992125 \cdot y}{z \cdot z} - x\right)\\ \mathbf{if}\;z < -8120153.652456675:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z < 6.576118972787377 \cdot 10^{+20}:\\ \;\;\;\;x + \left(y \cdot \left(\left(z \cdot 0.0692910599291889 + 0.4917317610505968\right) \cdot z + 0.279195317918525\right)\right) \cdot \frac{1}{\left(z + 6.012459259764103\right) \cdot z + 3.350343815022304}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0
         (-
          (* (+ (/ 0.07512208616047561 z) 0.0692910599291889) y)
          (- (/ (* 0.40462203869992125 y) (* z z)) x))))
   (if (< z -8120153.652456675)
     t_0
     (if (< z 6.576118972787377e+20)
       (+
        x
        (*
         (*
          y
          (+
           (* (+ (* z 0.0692910599291889) 0.4917317610505968) z)
           0.279195317918525))
         (/ 1.0 (+ (* (+ z 6.012459259764103) z) 3.350343815022304))))
       t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (((0.07512208616047561 / z) + 0.0692910599291889) * y) - (((0.40462203869992125 * y) / (z * z)) - x);
	double tmp;
	if (z < -8120153.652456675) {
		tmp = t_0;
	} else if (z < 6.576118972787377e+20) {
		tmp = x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) * (1.0 / (((z + 6.012459259764103) * z) + 3.350343815022304)));
	} else {
		tmp = t_0;
	}
	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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (((0.07512208616047561d0 / z) + 0.0692910599291889d0) * y) - (((0.40462203869992125d0 * y) / (z * z)) - x)
    if (z < (-8120153.652456675d0)) then
        tmp = t_0
    else if (z < 6.576118972787377d+20) then
        tmp = x + ((y * ((((z * 0.0692910599291889d0) + 0.4917317610505968d0) * z) + 0.279195317918525d0)) * (1.0d0 / (((z + 6.012459259764103d0) * z) + 3.350343815022304d0)))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (((0.07512208616047561 / z) + 0.0692910599291889) * y) - (((0.40462203869992125 * y) / (z * z)) - x);
	double tmp;
	if (z < -8120153.652456675) {
		tmp = t_0;
	} else if (z < 6.576118972787377e+20) {
		tmp = x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) * (1.0 / (((z + 6.012459259764103) * z) + 3.350343815022304)));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (((0.07512208616047561 / z) + 0.0692910599291889) * y) - (((0.40462203869992125 * y) / (z * z)) - x)
	tmp = 0
	if z < -8120153.652456675:
		tmp = t_0
	elif z < 6.576118972787377e+20:
		tmp = x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) * (1.0 / (((z + 6.012459259764103) * z) + 3.350343815022304)))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(Float64(0.07512208616047561 / z) + 0.0692910599291889) * y) - Float64(Float64(Float64(0.40462203869992125 * y) / Float64(z * z)) - x))
	tmp = 0.0
	if (z < -8120153.652456675)
		tmp = t_0;
	elseif (z < 6.576118972787377e+20)
		tmp = Float64(x + Float64(Float64(y * Float64(Float64(Float64(Float64(z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) * Float64(1.0 / Float64(Float64(Float64(z + 6.012459259764103) * z) + 3.350343815022304))));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (((0.07512208616047561 / z) + 0.0692910599291889) * y) - (((0.40462203869992125 * y) / (z * z)) - x);
	tmp = 0.0;
	if (z < -8120153.652456675)
		tmp = t_0;
	elseif (z < 6.576118972787377e+20)
		tmp = x + ((y * ((((z * 0.0692910599291889) + 0.4917317610505968) * z) + 0.279195317918525)) * (1.0 / (((z + 6.012459259764103) * z) + 3.350343815022304)));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(0.07512208616047561 / z), $MachinePrecision] + 0.0692910599291889), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(0.40462203869992125 * y), $MachinePrecision] / N[(z * z), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]}, If[Less[z, -8120153.652456675], t$95$0, If[Less[z, 6.576118972787377e+20], N[(x + N[(N[(y * N[(N[(N[(N[(z * 0.0692910599291889), $MachinePrecision] + 0.4917317610505968), $MachinePrecision] * z), $MachinePrecision] + 0.279195317918525), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(N[(z + 6.012459259764103), $MachinePrecision] * z), $MachinePrecision] + 3.350343815022304), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Reproduce

herbie shell --seed 2025032 
(FPCore (x y z)
  :name "Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -324806146098267/40000000) (- (* (+ (/ 7512208616047561/100000000000000000 z) 692910599291889/10000000000000000) y) (- (/ (* 323697630959937/800000000000000 y) (* z z)) x)) (if (< z 657611897278737700000) (+ x (* (* y (+ (* (+ (* z 692910599291889/10000000000000000) 307332350656623/625000000000000) z) 11167812716741/40000000000000)) (/ 1 (+ (* (+ z 6012459259764103/1000000000000000) z) 104698244219447/31250000000000)))) (- (* (+ (/ 7512208616047561/100000000000000000 z) 692910599291889/10000000000000000) y) (- (/ (* 323697630959937/800000000000000 y) (* z z)) x)))))

  (+ x (/ (* y (+ (* (+ (* z 0.0692910599291889) 0.4917317610505968) z) 0.279195317918525)) (+ (* (+ z 6.012459259764103) z) 3.350343815022304))))