Numeric.SpecFunctions:$slogFactorial from math-functions-0.1.5.2, B

Percentage Accurate: 93.7% → 93.7%

Time: 3.5s

Alternatives: 13

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ \left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+
  (+ (- (* (- x 0.5) (log x)) x) 0.91893853320467)
  (/
   (+
    (* (- (* (+ y 0.0007936500793651) z) 0.0027777777777778) z)
    0.083333333333333)
   x)))

C

double code(double x, double y, double z) {
	return ((((x - 0.5) * log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((((x - 0.5d0) * log(x)) - x) + 0.91893853320467d0) + ((((((y + 0.0007936500793651d0) * z) - 0.0027777777777778d0) * z) + 0.083333333333333d0) / x)
end function

Java

public static double code(double x, double y, double z) {
	return ((((x - 0.5) * Math.log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
}

Python

def code(x, y, z):
	return ((((x - 0.5) * math.log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(Float64(x - 0.5) * log(x)) - x) + 0.91893853320467) + Float64(Float64(Float64(Float64(Float64(Float64(y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((((x - 0.5) * log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(N[(N[(x - 0.5), $MachinePrecision] * N[Log[x], $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision] + 0.91893853320467), $MachinePrecision] + N[(N[(N[(N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] - 0.0027777777777778), $MachinePrecision] * z), $MachinePrecision] + 0.083333333333333), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]

Initial Program: 93.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+
  (+ (- (* (- x 0.5) (log x)) x) 0.91893853320467)
  (/
   (+
    (* (- (* (+ y 0.0007936500793651) z) 0.0027777777777778) z)
    0.083333333333333)
   x)))

C

double code(double x, double y, double z) {
	return ((((x - 0.5) * log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((((x - 0.5d0) * log(x)) - x) + 0.91893853320467d0) + ((((((y + 0.0007936500793651d0) * z) - 0.0027777777777778d0) * z) + 0.083333333333333d0) / x)
end function

Java

public static double code(double x, double y, double z) {
	return ((((x - 0.5) * Math.log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
}

Python

def code(x, y, z):
	return ((((x - 0.5) * math.log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(Float64(x - 0.5) * log(x)) - x) + 0.91893853320467) + Float64(Float64(Float64(Float64(Float64(Float64(y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((((x - 0.5) * log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(N[(N[(x - 0.5), $MachinePrecision] * N[Log[x], $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision] + 0.91893853320467), $MachinePrecision] + N[(N[(N[(N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] - 0.0027777777777778), $MachinePrecision] * z), $MachinePrecision] + 0.083333333333333), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]

Alternative 1: 93.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+
  (+ (- (* (- x 0.5) (log x)) x) 0.91893853320467)
  (/
   (+
    (* (- (* (+ y 0.0007936500793651) z) 0.0027777777777778) z)
    0.083333333333333)
   x)))

C

double code(double x, double y, double z) {
	return ((((x - 0.5) * log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((((x - 0.5d0) * log(x)) - x) + 0.91893853320467d0) + ((((((y + 0.0007936500793651d0) * z) - 0.0027777777777778d0) * z) + 0.083333333333333d0) / x)
end function

Java

public static double code(double x, double y, double z) {
	return ((((x - 0.5) * Math.log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
}

Python

def code(x, y, z):
	return ((((x - 0.5) * math.log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(Float64(x - 0.5) * log(x)) - x) + 0.91893853320467) + Float64(Float64(Float64(Float64(Float64(Float64(y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((((x - 0.5) * log(x)) - x) + 0.91893853320467) + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(N[(N[(x - 0.5), $MachinePrecision] * N[Log[x], $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision] + 0.91893853320467), $MachinePrecision] + N[(N[(N[(N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] - 0.0027777777777778), $MachinePrecision] * z), $MachinePrecision] + 0.083333333333333), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 91.6%

   \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 31.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z\\ t_1 := \left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{t\_0 + 0.083333333333333}{x}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+122}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+306}:\\ \;\;\;\;\left(x - 0.5\right) + 0.91893853320467\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- (* (+ y 0.0007936500793651) z) 0.0027777777777778) z))
        (t_1
         (+
          (+ (- (* (- x 0.5) (log x)) x) 0.91893853320467)
          (/ (+ t_0 0.083333333333333) x))))
   (if (<= t_1 -1e+122)
     t_0
     (if (<= t_1 4e+306) (+ (- x 0.5) 0.91893853320467) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (((y + 0.0007936500793651) * z) - 0.0027777777777778) * z;
	double t_1 = ((((x - 0.5) * log(x)) - x) + 0.91893853320467) + ((t_0 + 0.083333333333333) / x);
	double tmp;
	if (t_1 <= -1e+122) {
		tmp = t_0;
	} else if (t_1 <= 4e+306) {
		tmp = (x - 0.5) + 0.91893853320467;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (((y + 0.0007936500793651d0) * z) - 0.0027777777777778d0) * z
    t_1 = ((((x - 0.5d0) * log(x)) - x) + 0.91893853320467d0) + ((t_0 + 0.083333333333333d0) / x)
    if (t_1 <= (-1d+122)) then
        tmp = t_0
    else if (t_1 <= 4d+306) then
        tmp = (x - 0.5d0) + 0.91893853320467d0
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (((y + 0.0007936500793651) * z) - 0.0027777777777778) * z;
	double t_1 = ((((x - 0.5) * Math.log(x)) - x) + 0.91893853320467) + ((t_0 + 0.083333333333333) / x);
	double tmp;
	if (t_1 <= -1e+122) {
		tmp = t_0;
	} else if (t_1 <= 4e+306) {
		tmp = (x - 0.5) + 0.91893853320467;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (((y + 0.0007936500793651) * z) - 0.0027777777777778) * z
	t_1 = ((((x - 0.5) * math.log(x)) - x) + 0.91893853320467) + ((t_0 + 0.083333333333333) / x)
	tmp = 0
	if t_1 <= -1e+122:
		tmp = t_0
	elif t_1 <= 4e+306:
		tmp = (x - 0.5) + 0.91893853320467
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(Float64(y + 0.0007936500793651) * z) - 0.0027777777777778) * z)
	t_1 = Float64(Float64(Float64(Float64(Float64(x - 0.5) * log(x)) - x) + 0.91893853320467) + Float64(Float64(t_0 + 0.083333333333333) / x))
	tmp = 0.0
	if (t_1 <= -1e+122)
		tmp = t_0;
	elseif (t_1 <= 4e+306)
		tmp = Float64(Float64(x - 0.5) + 0.91893853320467);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (((y + 0.0007936500793651) * z) - 0.0027777777777778) * z;
	t_1 = ((((x - 0.5) * log(x)) - x) + 0.91893853320467) + ((t_0 + 0.083333333333333) / x);
	tmp = 0.0;
	if (t_1 <= -1e+122)
		tmp = t_0;
	elseif (t_1 <= 4e+306)
		tmp = (x - 0.5) + 0.91893853320467;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] - 0.0027777777777778), $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(N[(x - 0.5), $MachinePrecision] * N[Log[x], $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision] + 0.91893853320467), $MachinePrecision] + N[(N[(t$95$0 + 0.083333333333333), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+122], t$95$0, If[LessEqual[t$95$1, 4e+306], N[(N[(x - 0.5), $MachinePrecision] + 0.91893853320467), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (-.f64 (*.f64 (-.f64 x #s(literal 1/2 binary64)) (log.f64 x)) x) #s(literal 91893853320467/100000000000000 binary64)) (/.f64 (+.f64 (*.f64 (-.f64 (*.f64 (+.f64 y #s(literal 7936500793651/10000000000000000 binary64)) z) #s(literal 13888888888889/5000000000000000 binary64)) z) #s(literal 83333333333333/1000000000000000 binary64)) x)) < -1.00000000000000001e122 or 4.00000000000000007e306 < (+.f64 (+.f64 (-.f64 (*.f64 (-.f64 x #s(literal 1/2 binary64)) (log.f64 x)) x) #s(literal 91893853320467/100000000000000 binary64)) (/.f64 (+.f64 (*.f64 (-.f64 (*.f64 (+.f64 y #s(literal 7936500793651/10000000000000000 binary64)) z) #s(literal 13888888888889/5000000000000000 binary64)) z) #s(literal 83333333333333/1000000000000000 binary64)) x))

   1. Initial program 81.0%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 12.3%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(\left(-1 \cdot \log \left(\frac{1}{x}\right) + \left(\frac{1}{2} \cdot \frac{\log \left(\frac{1}{x}\right)}{x} + \left(\frac{\frac{83333333333333}{1000000000000000}}{{x}^{2}} + \left(\frac{91893853320467}{100000000000000} \cdot \frac{1}{x} + \frac{z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)}{{x}^{2}}\right)\right)\right)\right) - 1\right)} \]

   8. Applied rewrites 59.6%

      \[\leadsto \color{blue}{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z} \]

   if -1.00000000000000001e122 < (+.f64 (+.f64 (-.f64 (*.f64 (-.f64 x #s(literal 1/2 binary64)) (log.f64 x)) x) #s(literal 91893853320467/100000000000000 binary64)) (/.f64 (+.f64 (*.f64 (-.f64 (*.f64 (+.f64 y #s(literal 7936500793651/10000000000000000 binary64)) z) #s(literal 13888888888889/5000000000000000 binary64)) z) #s(literal 83333333333333/1000000000000000 binary64)) x)) < 4.00000000000000007e306

   1. Initial program 99.4%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 53.1%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{-1}{2} \cdot \log x + \frac{91893853320467}{100000000000000} \]

   8. Applied rewrites 9.9%

      \[\leadsto \left(x - 0.5\right) + 0.91893853320467 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 84.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x - 0.5\right) \cdot \log x\\ \mathbf{if}\;x \leq 1.1 \cdot 10^{+130}:\\ \;\;\;\;\left(t\_0 + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x}\right) + 0.91893853320467\\ \mathbf{else}:\\ \;\;\;\;t\_0 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- x 0.5) (log x))))
   (if (<= x 1.1e+130)
     (+
      (+
       t_0
       (/
        (+
         (* (- (* (+ y 0.0007936500793651) z) 0.0027777777777778) z)
         0.083333333333333)
        x))
      0.91893853320467)
     (- t_0 x))))

C

double code(double x, double y, double z) {
	double t_0 = (x - 0.5) * log(x);
	double tmp;
	if (x <= 1.1e+130) {
		tmp = (t_0 + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x)) + 0.91893853320467;
	} else {
		tmp = t_0 - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x - 0.5d0) * log(x)
    if (x <= 1.1d+130) then
        tmp = (t_0 + ((((((y + 0.0007936500793651d0) * z) - 0.0027777777777778d0) * z) + 0.083333333333333d0) / x)) + 0.91893853320467d0
    else
        tmp = t_0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (x - 0.5) * Math.log(x);
	double tmp;
	if (x <= 1.1e+130) {
		tmp = (t_0 + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x)) + 0.91893853320467;
	} else {
		tmp = t_0 - x;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (x - 0.5) * math.log(x)
	tmp = 0
	if x <= 1.1e+130:
		tmp = (t_0 + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x)) + 0.91893853320467
	else:
		tmp = t_0 - x
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x - 0.5) * log(x))
	tmp = 0.0
	if (x <= 1.1e+130)
		tmp = Float64(Float64(t_0 + Float64(Float64(Float64(Float64(Float64(Float64(y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x)) + 0.91893853320467);
	else
		tmp = Float64(t_0 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x - 0.5) * log(x);
	tmp = 0.0;
	if (x <= 1.1e+130)
		tmp = (t_0 + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x)) + 0.91893853320467;
	else
		tmp = t_0 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x - 0.5), $MachinePrecision] * N[Log[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 1.1e+130], N[(N[(t$95$0 + N[(N[(N[(N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] - 0.0027777777777778), $MachinePrecision] * z), $MachinePrecision] + 0.083333333333333), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + 0.91893853320467), $MachinePrecision], N[(t$95$0 - x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < 1.09999999999999997e130

   1. Initial program 98.0%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 14.6%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \left(\frac{-1}{2} \cdot \log x + x \cdot \left(\log x - 1\right)\right) + \frac{91893853320467}{100000000000000} \]

   8. Applied rewrites 88.6%

      \[\leadsto \left(\left(x - 0.5\right) \cdot \log x + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x}\right) + 0.91893853320467 \]

   if 1.09999999999999997e130 < x

   1. Initial program 78.6%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \left(\frac{-1}{2} \cdot \log x + x \cdot \left(\log x - 1\right)\right)\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 78.0%

      \[\leadsto \color{blue}{\left(x - 0.5\right) \cdot \log x - x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 84.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x - 0.5\right) \cdot \log x\\ \mathbf{if}\;x \leq 1.1 \cdot 10^{+130}:\\ \;\;\;\;t\_0 + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x}\\ \mathbf{else}:\\ \;\;\;\;t\_0 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- x 0.5) (log x))))
   (if (<= x 1.1e+130)
     (+
      t_0
      (/
       (+
        (* (- (* (+ y 0.0007936500793651) z) 0.0027777777777778) z)
        0.083333333333333)
       x))
     (- t_0 x))))

C

double code(double x, double y, double z) {
	double t_0 = (x - 0.5) * log(x);
	double tmp;
	if (x <= 1.1e+130) {
		tmp = t_0 + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
	} else {
		tmp = t_0 - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x - 0.5d0) * log(x)
    if (x <= 1.1d+130) then
        tmp = t_0 + ((((((y + 0.0007936500793651d0) * z) - 0.0027777777777778d0) * z) + 0.083333333333333d0) / x)
    else
        tmp = t_0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (x - 0.5) * Math.log(x);
	double tmp;
	if (x <= 1.1e+130) {
		tmp = t_0 + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
	} else {
		tmp = t_0 - x;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (x - 0.5) * math.log(x)
	tmp = 0
	if x <= 1.1e+130:
		tmp = t_0 + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x)
	else:
		tmp = t_0 - x
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x - 0.5) * log(x))
	tmp = 0.0
	if (x <= 1.1e+130)
		tmp = Float64(t_0 + Float64(Float64(Float64(Float64(Float64(Float64(y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x));
	else
		tmp = Float64(t_0 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x - 0.5) * log(x);
	tmp = 0.0;
	if (x <= 1.1e+130)
		tmp = t_0 + ((((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
	else
		tmp = t_0 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x - 0.5), $MachinePrecision] * N[Log[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 1.1e+130], N[(t$95$0 + N[(N[(N[(N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] - 0.0027777777777778), $MachinePrecision] * z), $MachinePrecision] + 0.083333333333333), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], N[(t$95$0 - x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < 1.09999999999999997e130

   1. Initial program 98.0%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right)} + \frac{\left(\left(y + \frac{7936500793651}{10000000000000000}\right) \cdot z - \frac{13888888888889}{5000000000000000}\right) \cdot z + \frac{83333333333333}{1000000000000000}}{x} \]

   5. Applied rewrites 87.5%

      \[\leadsto \color{blue}{\left(x - 0.5\right) \cdot \log x} + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]

   if 1.09999999999999997e130 < x

   1. Initial program 78.6%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \left(\frac{-1}{2} \cdot \log x + x \cdot \left(\log x - 1\right)\right)\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 78.0%

      \[\leadsto \color{blue}{\left(x - 0.5\right) \cdot \log x - x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 84.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 6.6 \cdot 10^{+40}:\\ \;\;\;\;\frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x}\\ \mathbf{else}:\\ \;\;\;\;\left(x - 0.5\right) \cdot \log x - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x 6.6e+40)
   (/
    (+
     (* (- (* (+ y 0.0007936500793651) z) 0.0027777777777778) z)
     0.083333333333333)
    x)
   (- (* (- x 0.5) (log x)) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= 6.6e+40) {
		tmp = (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x;
	} else {
		tmp = ((x - 0.5) * log(x)) - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= 6.6d+40) then
        tmp = (((((y + 0.0007936500793651d0) * z) - 0.0027777777777778d0) * z) + 0.083333333333333d0) / x
    else
        tmp = ((x - 0.5d0) * log(x)) - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= 6.6e+40) {
		tmp = (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x;
	} else {
		tmp = ((x - 0.5) * Math.log(x)) - x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= 6.6e+40:
		tmp = (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x
	else:
		tmp = ((x - 0.5) * math.log(x)) - x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= 6.6e+40)
		tmp = Float64(Float64(Float64(Float64(Float64(Float64(y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
	else
		tmp = Float64(Float64(Float64(x - 0.5) * log(x)) - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= 6.6e+40)
		tmp = (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x;
	else
		tmp = ((x - 0.5) * log(x)) - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, 6.6e+40], N[(N[(N[(N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] - 0.0027777777777778), $MachinePrecision] * z), $MachinePrecision] + 0.083333333333333), $MachinePrecision] / x), $MachinePrecision], N[(N[(N[(x - 0.5), $MachinePrecision] * N[Log[x], $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 6.5999999999999997e40

   1. Initial program 99.7%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 6.1%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{91893853320467}{100000000000000} + \color{blue}{\frac{-1}{2} \cdot \log x} \]

   8. Applied rewrites 4.5%

      \[\leadsto \left(x - 0.5\right) \cdot \color{blue}{\log x} \]

   9. Taylor expanded in x around inf

      \[\leadsto -1 \cdot \left(x \cdot \color{blue}{\log \left(\frac{1}{x}\right)}\right) \]

   11. Applied rewrites 94.0%

       \[\leadsto \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]

   if 6.5999999999999997e40 < x

   1. Initial program 81.8%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \left(\frac{-1}{2} \cdot \log x + x \cdot \left(\log x - 1\right)\right)\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 71.4%

      \[\leadsto \color{blue}{\left(x - 0.5\right) \cdot \log x - x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 66.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1.5 \cdot 10^{+131}:\\ \;\;\;\;\frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x}\\ \mathbf{else}:\\ \;\;\;\;\left(x - 0.5\right) \cdot \log x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x 1.5e+131)
   (/
    (+
     (* (- (* (+ y 0.0007936500793651) z) 0.0027777777777778) z)
     0.083333333333333)
    x)
   (* (- x 0.5) (log x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= 1.5e+131) {
		tmp = (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x;
	} else {
		tmp = (x - 0.5) * log(x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= 1.5d+131) then
        tmp = (((((y + 0.0007936500793651d0) * z) - 0.0027777777777778d0) * z) + 0.083333333333333d0) / x
    else
        tmp = (x - 0.5d0) * log(x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= 1.5e+131) {
		tmp = (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x;
	} else {
		tmp = (x - 0.5) * Math.log(x);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= 1.5e+131:
		tmp = (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x
	else:
		tmp = (x - 0.5) * math.log(x)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= 1.5e+131)
		tmp = Float64(Float64(Float64(Float64(Float64(Float64(y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x);
	else
		tmp = Float64(Float64(x - 0.5) * log(x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= 1.5e+131)
		tmp = (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x;
	else
		tmp = (x - 0.5) * log(x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, 1.5e+131], N[(N[(N[(N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] - 0.0027777777777778), $MachinePrecision] * z), $MachinePrecision] + 0.083333333333333), $MachinePrecision] / x), $MachinePrecision], N[(N[(x - 0.5), $MachinePrecision] * N[Log[x], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.5000000000000001e131

   1. Initial program 98.0%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 14.6%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{91893853320467}{100000000000000} + \color{blue}{\frac{-1}{2} \cdot \log x} \]

   8. Applied rewrites 6.8%

      \[\leadsto \left(x - 0.5\right) \cdot \color{blue}{\log x} \]

   9. Taylor expanded in x around inf

      \[\leadsto -1 \cdot \left(x \cdot \color{blue}{\log \left(\frac{1}{x}\right)}\right) \]

   11. Applied rewrites 84.5%

       \[\leadsto \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]

   if 1.5000000000000001e131 < x

   1. Initial program 78.6%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 78.0%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{91893853320467}{100000000000000} + \color{blue}{\frac{-1}{2} \cdot \log x} \]

   8. Applied rewrites 26.6%

      \[\leadsto \left(x - 0.5\right) \cdot \color{blue}{\log x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 63.4% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (/
  (+
   (* (- (* (+ y 0.0007936500793651) z) 0.0027777777777778) z)
   0.083333333333333)
  x))

C

double code(double x, double y, double z) {
	return (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (((((y + 0.0007936500793651d0) * z) - 0.0027777777777778d0) * z) + 0.083333333333333d0) / x
end function

Java

public static double code(double x, double y, double z) {
	return (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x;
}

Python

def code(x, y, z):
	return (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(Float64(Float64(y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (((((y + 0.0007936500793651) * z) - 0.0027777777777778) * z) + 0.083333333333333) / x;
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] - 0.0027777777777778), $MachinePrecision] * z), $MachinePrecision] + 0.083333333333333), $MachinePrecision] / x), $MachinePrecision]

Derivation

1. Initial program 91.6%

   \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

5. Applied rewrites 35.7%

   \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

6. Taylor expanded in x around 0

   \[\leadsto \frac{91893853320467}{100000000000000} + \color{blue}{\frac{-1}{2} \cdot \log x} \]

8. Applied rewrites 13.4%

   \[\leadsto \left(x - 0.5\right) \cdot \color{blue}{\log x} \]

9. Taylor expanded in x around inf

   \[\leadsto -1 \cdot \left(x \cdot \color{blue}{\log \left(\frac{1}{x}\right)}\right) \]

11. Applied rewrites 61.4%

    \[\leadsto \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
12. Add Preprocessing

Alternative 8: 13.9% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -8 \cdot 10^{+97}:\\ \;\;\;\;\left(x - 0.5\right) \cdot \left(y + 0.0007936500793651\right)\\ \mathbf{elif}\;z \leq 2.35 \cdot 10^{+29}:\\ \;\;\;\;\left(x - 0.5\right) + 0.91893853320467\\ \mathbf{else}:\\ \;\;\;\;\left(y + 0.0007936500793651\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -8e+97)
   (* (- x 0.5) (+ y 0.0007936500793651))
   (if (<= z 2.35e+29)
     (+ (- x 0.5) 0.91893853320467)
     (* (+ y 0.0007936500793651) z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -8e+97) {
		tmp = (x - 0.5) * (y + 0.0007936500793651);
	} else if (z <= 2.35e+29) {
		tmp = (x - 0.5) + 0.91893853320467;
	} else {
		tmp = (y + 0.0007936500793651) * z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-8d+97)) then
        tmp = (x - 0.5d0) * (y + 0.0007936500793651d0)
    else if (z <= 2.35d+29) then
        tmp = (x - 0.5d0) + 0.91893853320467d0
    else
        tmp = (y + 0.0007936500793651d0) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -8e+97) {
		tmp = (x - 0.5) * (y + 0.0007936500793651);
	} else if (z <= 2.35e+29) {
		tmp = (x - 0.5) + 0.91893853320467;
	} else {
		tmp = (y + 0.0007936500793651) * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -8e+97:
		tmp = (x - 0.5) * (y + 0.0007936500793651)
	elif z <= 2.35e+29:
		tmp = (x - 0.5) + 0.91893853320467
	else:
		tmp = (y + 0.0007936500793651) * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -8e+97)
		tmp = Float64(Float64(x - 0.5) * Float64(y + 0.0007936500793651));
	elseif (z <= 2.35e+29)
		tmp = Float64(Float64(x - 0.5) + 0.91893853320467);
	else
		tmp = Float64(Float64(y + 0.0007936500793651) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -8e+97)
		tmp = (x - 0.5) * (y + 0.0007936500793651);
	elseif (z <= 2.35e+29)
		tmp = (x - 0.5) + 0.91893853320467;
	else
		tmp = (y + 0.0007936500793651) * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -8e+97], N[(N[(x - 0.5), $MachinePrecision] * N[(y + 0.0007936500793651), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.35e+29], N[(N[(x - 0.5), $MachinePrecision] + 0.91893853320467), $MachinePrecision], N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -8.0000000000000006e97

   1. Initial program 77.8%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 13.4%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{91893853320467}{100000000000000} + \color{blue}{\frac{-1}{2} \cdot \log x} \]

   8. Applied rewrites 6.2%

      \[\leadsto \left(x - 0.5\right) \cdot \color{blue}{\log x} \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(x - \frac{1}{2}\right) \cdot \log x \]

   11. Applied rewrites 17.9%

       \[\leadsto \left(x - 0.5\right) \cdot \left(y + 0.0007936500793651\right) \]

   if -8.0000000000000006e97 < z < 2.3500000000000001e29

   1. Initial program 98.2%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 47.8%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{-1}{2} \cdot \log x + \frac{91893853320467}{100000000000000} \]

   8. Applied rewrites 9.1%

      \[\leadsto \left(x - 0.5\right) + 0.91893853320467 \]

   if 2.3500000000000001e29 < z

   1. Initial program 83.8%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \left(\frac{-1}{2} \cdot \log x + x \cdot \left(\log x - 1\right)\right)\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 19.1%

      \[\leadsto \color{blue}{\left(x - 0.5\right) \cdot \log x - x} \]

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(\left(-1 \cdot \log \left(\frac{1}{x}\right) + \frac{1}{2} \cdot \frac{\log \left(\frac{1}{x}\right)}{x}\right) - 1\right)} \]

   8. Applied rewrites 29.4%

      \[\leadsto \left(y + 0.0007936500793651\right) \cdot \color{blue}{z} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 11.7% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 4.8 \cdot 10^{+37}:\\ \;\;\;\;\left(\left(y + 0.0007936500793651\right) \cdot z + 0.91893853320467\right) + 0.91893853320467\\ \mathbf{else}:\\ \;\;\;\;\left(x - 0.5\right) \cdot \left(y + 0.0007936500793651\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x 4.8e+37)
   (+ (+ (* (+ y 0.0007936500793651) z) 0.91893853320467) 0.91893853320467)
   (* (- x 0.5) (+ y 0.0007936500793651))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= 4.8e+37) {
		tmp = (((y + 0.0007936500793651) * z) + 0.91893853320467) + 0.91893853320467;
	} else {
		tmp = (x - 0.5) * (y + 0.0007936500793651);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= 4.8d+37) then
        tmp = (((y + 0.0007936500793651d0) * z) + 0.91893853320467d0) + 0.91893853320467d0
    else
        tmp = (x - 0.5d0) * (y + 0.0007936500793651d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= 4.8e+37) {
		tmp = (((y + 0.0007936500793651) * z) + 0.91893853320467) + 0.91893853320467;
	} else {
		tmp = (x - 0.5) * (y + 0.0007936500793651);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= 4.8e+37:
		tmp = (((y + 0.0007936500793651) * z) + 0.91893853320467) + 0.91893853320467
	else:
		tmp = (x - 0.5) * (y + 0.0007936500793651)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= 4.8e+37)
		tmp = Float64(Float64(Float64(Float64(y + 0.0007936500793651) * z) + 0.91893853320467) + 0.91893853320467);
	else
		tmp = Float64(Float64(x - 0.5) * Float64(y + 0.0007936500793651));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= 4.8e+37)
		tmp = (((y + 0.0007936500793651) * z) + 0.91893853320467) + 0.91893853320467;
	else
		tmp = (x - 0.5) * (y + 0.0007936500793651);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, 4.8e+37], N[(N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] + 0.91893853320467), $MachinePrecision] + 0.91893853320467), $MachinePrecision], N[(N[(x - 0.5), $MachinePrecision] * N[(y + 0.0007936500793651), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 4.8e37

   1. Initial program 99.7%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 6.1%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{-1}{2} \cdot \log x + \frac{91893853320467}{100000000000000} \]

   8. Applied rewrites 4.2%

      \[\leadsto \left(x - 0.5\right) + 0.91893853320467 \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(x - \frac{1}{2}\right) + \frac{91893853320467}{100000000000000} \]

   11. Applied rewrites 10.6%

       \[\leadsto \left(\left(y + 0.0007936500793651\right) \cdot z + 0.91893853320467\right) + 0.91893853320467 \]

   if 4.8e37 < x

   1. Initial program 82.0%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 70.8%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{91893853320467}{100000000000000} + \color{blue}{\frac{-1}{2} \cdot \log x} \]

   8. Applied rewrites 23.9%

      \[\leadsto \left(x - 0.5\right) \cdot \color{blue}{\log x} \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(x - \frac{1}{2}\right) \cdot \log x \]

   11. Applied rewrites 16.9%

       \[\leadsto \left(x - 0.5\right) \cdot \left(y + 0.0007936500793651\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 11.7% accurate, 8.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 4.8 \cdot 10^{+37}:\\ \;\;\;\;\left(y + 0.0007936500793651\right) \cdot z + 0.91893853320467\\ \mathbf{else}:\\ \;\;\;\;\left(x - 0.5\right) \cdot \left(y + 0.0007936500793651\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x 4.8e+37)
   (+ (* (+ y 0.0007936500793651) z) 0.91893853320467)
   (* (- x 0.5) (+ y 0.0007936500793651))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= 4.8e+37) {
		tmp = ((y + 0.0007936500793651) * z) + 0.91893853320467;
	} else {
		tmp = (x - 0.5) * (y + 0.0007936500793651);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= 4.8d+37) then
        tmp = ((y + 0.0007936500793651d0) * z) + 0.91893853320467d0
    else
        tmp = (x - 0.5d0) * (y + 0.0007936500793651d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= 4.8e+37) {
		tmp = ((y + 0.0007936500793651) * z) + 0.91893853320467;
	} else {
		tmp = (x - 0.5) * (y + 0.0007936500793651);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= 4.8e+37:
		tmp = ((y + 0.0007936500793651) * z) + 0.91893853320467
	else:
		tmp = (x - 0.5) * (y + 0.0007936500793651)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= 4.8e+37)
		tmp = Float64(Float64(Float64(y + 0.0007936500793651) * z) + 0.91893853320467);
	else
		tmp = Float64(Float64(x - 0.5) * Float64(y + 0.0007936500793651));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= 4.8e+37)
		tmp = ((y + 0.0007936500793651) * z) + 0.91893853320467;
	else
		tmp = (x - 0.5) * (y + 0.0007936500793651);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, 4.8e+37], N[(N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision] + 0.91893853320467), $MachinePrecision], N[(N[(x - 0.5), $MachinePrecision] * N[(y + 0.0007936500793651), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 4.8e37

   1. Initial program 99.7%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 6.1%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \left(\left(-1 \cdot \log \left(\frac{1}{x}\right) + \frac{1}{2} \cdot \frac{\log \left(\frac{1}{x}\right)}{x}\right) - 1\right) + \frac{91893853320467}{100000000000000} \]

   8. Applied rewrites 10.5%

      \[\leadsto \left(y + 0.0007936500793651\right) \cdot z + 0.91893853320467 \]

   if 4.8e37 < x

   1. Initial program 82.0%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 70.8%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{91893853320467}{100000000000000} + \color{blue}{\frac{-1}{2} \cdot \log x} \]

   8. Applied rewrites 23.9%

      \[\leadsto \left(x - 0.5\right) \cdot \color{blue}{\log x} \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(x - \frac{1}{2}\right) \cdot \log x \]

   11. Applied rewrites 16.9%

       \[\leadsto \left(x - 0.5\right) \cdot \left(y + 0.0007936500793651\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 12.6% accurate, 9.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 2.35 \cdot 10^{+29}:\\ \;\;\;\;\left(x - 0.5\right) + 0.91893853320467\\ \mathbf{else}:\\ \;\;\;\;\left(y + 0.0007936500793651\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z 2.35e+29)
   (+ (- x 0.5) 0.91893853320467)
   (* (+ y 0.0007936500793651) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= 2.35e+29) {
		tmp = (x - 0.5) + 0.91893853320467;
	} else {
		tmp = (y + 0.0007936500793651) * z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 2.35d+29) then
        tmp = (x - 0.5d0) + 0.91893853320467d0
    else
        tmp = (y + 0.0007936500793651d0) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= 2.35e+29) {
		tmp = (x - 0.5) + 0.91893853320467;
	} else {
		tmp = (y + 0.0007936500793651) * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= 2.35e+29:
		tmp = (x - 0.5) + 0.91893853320467
	else:
		tmp = (y + 0.0007936500793651) * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= 2.35e+29)
		tmp = Float64(Float64(x - 0.5) + 0.91893853320467);
	else
		tmp = Float64(Float64(y + 0.0007936500793651) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= 2.35e+29)
		tmp = (x - 0.5) + 0.91893853320467;
	else
		tmp = (y + 0.0007936500793651) * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, 2.35e+29], N[(N[(x - 0.5), $MachinePrecision] + 0.91893853320467), $MachinePrecision], N[(N[(y + 0.0007936500793651), $MachinePrecision] * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 2.3500000000000001e29

   1. Initial program 93.6%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 40.0%

      \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{-1}{2} \cdot \log x + \frac{91893853320467}{100000000000000} \]

   8. Applied rewrites 7.9%

      \[\leadsto \left(x - 0.5\right) + 0.91893853320467 \]

   if 2.3500000000000001e29 < z

   1. Initial program 83.8%

      \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \left(\frac{-1}{2} \cdot \log x + x \cdot \left(\log x - 1\right)\right)\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

   5. Applied rewrites 19.1%

      \[\leadsto \color{blue}{\left(x - 0.5\right) \cdot \log x - x} \]

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(\left(-1 \cdot \log \left(\frac{1}{x}\right) + \frac{1}{2} \cdot \frac{\log \left(\frac{1}{x}\right)}{x}\right) - 1\right)} \]

   8. Applied rewrites 29.4%

      \[\leadsto \left(y + 0.0007936500793651\right) \cdot \color{blue}{z} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 7.4% accurate, 21.1× speedup

Math

\[\begin{array}{l} \\ \left(x - 0.5\right) + 0.91893853320467 \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ (- x 0.5) 0.91893853320467))

C

double code(double x, double y, double z) {
	return (x - 0.5) + 0.91893853320467;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x - 0.5d0) + 0.91893853320467d0
end function

Java

public static double code(double x, double y, double z) {
	return (x - 0.5) + 0.91893853320467;
}

Python

def code(x, y, z):
	return (x - 0.5) + 0.91893853320467

Julia

function code(x, y, z)
	return Float64(Float64(x - 0.5) + 0.91893853320467)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x - 0.5) + 0.91893853320467;
end

Wolfram

code[x_, y_, z_] := N[(N[(x - 0.5), $MachinePrecision] + 0.91893853320467), $MachinePrecision]

Derivation

1. Initial program 91.6%

   \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \frac{-1}{2} \cdot \log x\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

5. Applied rewrites 35.7%

   \[\leadsto \color{blue}{\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467} \]

6. Taylor expanded in x around 0

   \[\leadsto \frac{-1}{2} \cdot \log x + \frac{91893853320467}{100000000000000} \]

8. Applied rewrites 7.3%

   \[\leadsto \left(x - 0.5\right) + 0.91893853320467 \]
9. Add Preprocessing

Alternative 13: 6.1% accurate, 37.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return x - 0.5;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x - 0.5d0
end function

Java

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

Python

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

Julia

function code(x, y, z)
	return Float64(x - 0.5)
end

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(x - 0.5), $MachinePrecision]

Derivation

1. Initial program 91.6%

   \[\left(\left(\left(x - 0.5\right) \cdot \log x - x\right) + 0.91893853320467\right) + \frac{\left(\left(y + 0.0007936500793651\right) \cdot z - 0.0027777777777778\right) \cdot z + 0.083333333333333}{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\frac{\frac{83333333333333}{1000000000000000} + \left(x \cdot \left(\frac{91893853320467}{100000000000000} + \left(\frac{-1}{2} \cdot \log x + x \cdot \left(\log x - 1\right)\right)\right) + z \cdot \left(z \cdot \left(\frac{7936500793651}{10000000000000000} + y\right) - \frac{13888888888889}{5000000000000000}\right)\right)}{x}} \]

5. Applied rewrites 35.5%

   \[\leadsto \color{blue}{\left(x - 0.5\right) \cdot \log x - x} \]

6. Taylor expanded in x around 0

   \[\leadsto \frac{-1}{2} \cdot \color{blue}{\log x} \]

8. Applied rewrites 6.1%

   \[\leadsto x - \color{blue}{0.5} \]
9. Add Preprocessing

Developer Target 1: 98.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \left(\left(\left(x - 0.5\right) \cdot \log x + \left(0.91893853320467 - x\right)\right) + \frac{0.083333333333333}{x}\right) + \frac{z}{x} \cdot \left(z \cdot \left(y + 0.0007936500793651\right) - 0.0027777777777778\right) \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (+
  (+ (+ (* (- x 0.5) (log x)) (- 0.91893853320467 x)) (/ 0.083333333333333 x))
  (* (/ z x) (- (* z (+ y 0.0007936500793651)) 0.0027777777777778))))

C

double code(double x, double y, double z) {
	return ((((x - 0.5) * log(x)) + (0.91893853320467 - x)) + (0.083333333333333 / x)) + ((z / x) * ((z * (y + 0.0007936500793651)) - 0.0027777777777778));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((((x - 0.5d0) * log(x)) + (0.91893853320467d0 - x)) + (0.083333333333333d0 / x)) + ((z / x) * ((z * (y + 0.0007936500793651d0)) - 0.0027777777777778d0))
end function

Java

public static double code(double x, double y, double z) {
	return ((((x - 0.5) * Math.log(x)) + (0.91893853320467 - x)) + (0.083333333333333 / x)) + ((z / x) * ((z * (y + 0.0007936500793651)) - 0.0027777777777778));
}

Python

def code(x, y, z):
	return ((((x - 0.5) * math.log(x)) + (0.91893853320467 - x)) + (0.083333333333333 / x)) + ((z / x) * ((z * (y + 0.0007936500793651)) - 0.0027777777777778))

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(Float64(x - 0.5) * log(x)) + Float64(0.91893853320467 - x)) + Float64(0.083333333333333 / x)) + Float64(Float64(z / x) * Float64(Float64(z * Float64(y + 0.0007936500793651)) - 0.0027777777777778)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((((x - 0.5) * log(x)) + (0.91893853320467 - x)) + (0.083333333333333 / x)) + ((z / x) * ((z * (y + 0.0007936500793651)) - 0.0027777777777778));
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(N[(N[(x - 0.5), $MachinePrecision] * N[Log[x], $MachinePrecision]), $MachinePrecision] + N[(0.91893853320467 - x), $MachinePrecision]), $MachinePrecision] + N[(0.083333333333333 / x), $MachinePrecision]), $MachinePrecision] + N[(N[(z / x), $MachinePrecision] * N[(N[(z * N[(y + 0.0007936500793651), $MachinePrecision]), $MachinePrecision] - 0.0027777777777778), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

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

  :alt
  (! :herbie-platform default (+ (+ (+ (* (- x 1/2) (log x)) (- 91893853320467/100000000000000 x)) (/ 83333333333333/1000000000000000 x)) (* (/ z x) (- (* z (+ y 7936500793651/10000000000000000)) 13888888888889/5000000000000000))))

  (+ (+ (- (* (- x 0.5) (log x)) x) 0.91893853320467) (/ (+ (* (- (* (+ y 0.0007936500793651) z) 0.0027777777777778) z) 0.083333333333333) x)))