Numeric.SpecFunctions:logBeta from math-functions-0.1.5.2, A

Percentage Accurate: 99.8% → 99.9%

Time: 10.3s

Alternatives: 17

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (+ (+ x y) z) (* z (log t))) (* (- a 0.5) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (((x + y) + z) - (z * log(t))) + ((a - 0.5) * b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (((x + y) + z) - (z * log(t))) + ((a - 0.5d0) * b)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return (((x + y) + z) - (z * Math.log(t))) + ((a - 0.5) * b);
}

Python

def code(x, y, z, t, a, b):
	return (((x + y) + z) - (z * math.log(t))) + ((a - 0.5) * b)

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(Float64(x + y) + z) - Float64(z * log(t))) + Float64(Float64(a - 0.5) * b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = (((x + y) + z) - (z * log(t))) + ((a - 0.5) * b);
end

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (+ (+ x y) z) (* z (log t))) (* (- a 0.5) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (((x + y) + z) - (z * log(t))) + ((a - 0.5) * b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (((x + y) + z) - (z * log(t))) + ((a - 0.5d0) * b)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return (((x + y) + z) - (z * Math.log(t))) + ((a - 0.5) * b);
}

Python

def code(x, y, z, t, a, b):
	return (((x + y) + z) - (z * math.log(t))) + ((a - 0.5) * b)

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(Float64(x + y) + z) - Float64(z * log(t))) + Float64(Float64(a - 0.5) * b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = (((x + y) + z) - (z * log(t))) + ((a - 0.5) * b);
end

Wolfram

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

Alternative 1: 99.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right) \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (* z (- 1.0 (log t))) (fma (+ a -0.5) b (+ x y))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (z * (1.0 - log(t))) + fma((a + -0.5), b, (x + y));
}

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(z * Float64(1.0 - log(t))) + fma(Float64(a + -0.5), b, Float64(x + y)))
end

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
2. Step-by-step derivation

   1. +-commutative 99.9%

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

   2. associate--l+ 99.9%

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

   3. associate-+r+ 99.9%

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

   4. +-commutative 99.9%

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

   5. *-lft-identity 99.9%

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

   6. metadata-eval 99.9%

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

   7. *-commutative 99.9%

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

   8. distribute-rgt-out-- 99.9%

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

   9. metadata-eval 99.9%

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

   10. fma-define 99.9%

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

   11. sub-neg 99.9%

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

   12. metadata-eval 99.9%

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

3. Simplified 99.9%

   \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 89.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* b (- a 0.5))))
   (if (or (<= t_1 -1e+132) (not (<= t_1 2e+114)))
     (+ (+ x y) t_1)
     (+ x (+ (* z (- 1.0 (log t))) y)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = b * (a - 0.5);
	double tmp;
	if ((t_1 <= -1e+132) || !(t_1 <= 2e+114)) {
		tmp = (x + y) + t_1;
	} else {
		tmp = x + ((z * (1.0 - log(t))) + y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = b * (a - 0.5d0)
    if ((t_1 <= (-1d+132)) .or. (.not. (t_1 <= 2d+114))) then
        tmp = (x + y) + t_1
    else
        tmp = x + ((z * (1.0d0 - log(t))) + y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = b * (a - 0.5);
	double tmp;
	if ((t_1 <= -1e+132) || !(t_1 <= 2e+114)) {
		tmp = (x + y) + t_1;
	} else {
		tmp = x + ((z * (1.0 - Math.log(t))) + y);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = b * (a - 0.5)
	tmp = 0
	if (t_1 <= -1e+132) or not (t_1 <= 2e+114):
		tmp = (x + y) + t_1
	else:
		tmp = x + ((z * (1.0 - math.log(t))) + y)
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(b * Float64(a - 0.5))
	tmp = 0.0
	if ((t_1 <= -1e+132) || !(t_1 <= 2e+114))
		tmp = Float64(Float64(x + y) + t_1);
	else
		tmp = Float64(x + Float64(Float64(z * Float64(1.0 - log(t))) + y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = b * (a - 0.5);
	tmp = 0.0;
	if ((t_1 <= -1e+132) || ~((t_1 <= 2e+114)))
		tmp = (x + y) + t_1;
	else
		tmp = x + ((z * (1.0 - log(t))) + y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e+132], N[Not[LessEqual[t$95$1, 2e+114]], $MachinePrecision]], N[(N[(x + y), $MachinePrecision] + t$95$1), $MachinePrecision], N[(x + N[(N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < -9.99999999999999991e131 or 2e114 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b)

   1. Initial program 100.0%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 94.1%

      \[\leadsto \color{blue}{\left(x + y\right)} + \left(a - 0.5\right) \cdot b \]

   if -9.99999999999999991e131 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < 2e114

   1. Initial program 99.8%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate--l+ 99.8%

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

      3. associate-+r+ 99.8%

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

      4. +-commutative 99.8%

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

      5. *-lft-identity 99.8%

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

      6. metadata-eval 99.8%

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

      7. *-commutative 99.8%

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

      8. distribute-rgt-out-- 99.8%

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

      9. metadata-eval 99.8%

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

      10. fma-define 99.8%

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

      11. sub-neg 99.8%

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

      12. metadata-eval 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around 0 91.5%

      \[\leadsto \color{blue}{x + \left(y + z \cdot \left(1 - \log t\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.5%

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

Alternative 3: 88.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := b \cdot \left(a - 0.5\right)\\ t_2 := t\_1 + \left(z - z \cdot \log t\right)\\ \mathbf{if}\;z \leq -3.2 \cdot 10^{+191}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;z \leq 1.04 \cdot 10^{+117}:\\ \;\;\;\;\left(x + y\right) + t\_1\\ \mathbf{elif}\;z \leq 10^{+213}:\\ \;\;\;\;x + \left(z \cdot \left(1 - \log t\right) + y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* b (- a 0.5))) (t_2 (+ t_1 (- z (* z (log t))))))
   (if (<= z -3.2e+191)
     t_2
     (if (<= z 1.04e+117)
       (+ (+ x y) t_1)
       (if (<= z 1e+213) (+ x (+ (* z (- 1.0 (log t))) y)) t_2)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = b * (a - 0.5);
	double t_2 = t_1 + (z - (z * log(t)));
	double tmp;
	if (z <= -3.2e+191) {
		tmp = t_2;
	} else if (z <= 1.04e+117) {
		tmp = (x + y) + t_1;
	} else if (z <= 1e+213) {
		tmp = x + ((z * (1.0 - log(t))) + y);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = b * (a - 0.5d0)
    t_2 = t_1 + (z - (z * log(t)))
    if (z <= (-3.2d+191)) then
        tmp = t_2
    else if (z <= 1.04d+117) then
        tmp = (x + y) + t_1
    else if (z <= 1d+213) then
        tmp = x + ((z * (1.0d0 - log(t))) + y)
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = b * (a - 0.5);
	double t_2 = t_1 + (z - (z * Math.log(t)));
	double tmp;
	if (z <= -3.2e+191) {
		tmp = t_2;
	} else if (z <= 1.04e+117) {
		tmp = (x + y) + t_1;
	} else if (z <= 1e+213) {
		tmp = x + ((z * (1.0 - Math.log(t))) + y);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = b * (a - 0.5)
	t_2 = t_1 + (z - (z * math.log(t)))
	tmp = 0
	if z <= -3.2e+191:
		tmp = t_2
	elif z <= 1.04e+117:
		tmp = (x + y) + t_1
	elif z <= 1e+213:
		tmp = x + ((z * (1.0 - math.log(t))) + y)
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(b * Float64(a - 0.5))
	t_2 = Float64(t_1 + Float64(z - Float64(z * log(t))))
	tmp = 0.0
	if (z <= -3.2e+191)
		tmp = t_2;
	elseif (z <= 1.04e+117)
		tmp = Float64(Float64(x + y) + t_1);
	elseif (z <= 1e+213)
		tmp = Float64(x + Float64(Float64(z * Float64(1.0 - log(t))) + y));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = b * (a - 0.5);
	t_2 = t_1 + (z - (z * log(t)));
	tmp = 0.0;
	if (z <= -3.2e+191)
		tmp = t_2;
	elseif (z <= 1.04e+117)
		tmp = (x + y) + t_1;
	elseif (z <= 1e+213)
		tmp = x + ((z * (1.0 - log(t))) + y);
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + N[(z - N[(z * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.2e+191], t$95$2, If[LessEqual[z, 1.04e+117], N[(N[(x + y), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[z, 1e+213], N[(x + N[(N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.2000000000000002e191 or 9.99999999999999984e212 < z

   1. Initial program 99.6%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 95.9%

      \[\leadsto \color{blue}{\left(\left(x + z\right) - z \cdot \log t\right)} + \left(a - 0.5\right) \cdot b \]

   4. Taylor expanded in x around 0 92.0%

      \[\leadsto \color{blue}{\left(z - z \cdot \log t\right)} + \left(a - 0.5\right) \cdot b \]

   if -3.2000000000000002e191 < z < 1.03999999999999995e117

   1. Initial program 100.0%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 96.4%

      \[\leadsto \color{blue}{\left(x + y\right)} + \left(a - 0.5\right) \cdot b \]

   if 1.03999999999999995e117 < z < 9.99999999999999984e212

   1. Initial program 99.8%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate--l+ 99.8%

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

      3. associate-+r+ 99.8%

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

      4. +-commutative 99.8%

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

      5. *-lft-identity 99.8%

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

      6. metadata-eval 99.8%

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

      7. *-commutative 99.8%

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

      8. distribute-rgt-out-- 99.8%

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

      9. metadata-eval 99.8%

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

      10. fma-define 99.8%

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

      11. sub-neg 99.8%

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

      12. metadata-eval 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around 0 84.3%

      \[\leadsto \color{blue}{x + \left(y + z \cdot \left(1 - \log t\right)\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 94.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.2 \cdot 10^{+191}:\\ \;\;\;\;b \cdot \left(a - 0.5\right) + \left(z - z \cdot \log t\right)\\ \mathbf{elif}\;z \leq 1.04 \cdot 10^{+117}:\\ \;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\ \mathbf{elif}\;z \leq 10^{+213}:\\ \;\;\;\;x + \left(z \cdot \left(1 - \log t\right) + y\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(a - 0.5\right) + \left(z - z \cdot \log t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 91.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := b \cdot \left(a - 0.5\right)\\ \mathbf{if}\;z \leq -2 \cdot 10^{+136} \lor \neg \left(z \leq 1.06 \cdot 10^{+57}\right):\\ \;\;\;\;t\_1 + \left(\left(z + x\right) - z \cdot \log t\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) + t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* b (- a 0.5))))
   (if (or (<= z -2e+136) (not (<= z 1.06e+57)))
     (+ t_1 (- (+ z x) (* z (log t))))
     (+ (+ x y) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = b * (a - 0.5);
	double tmp;
	if ((z <= -2e+136) || !(z <= 1.06e+57)) {
		tmp = t_1 + ((z + x) - (z * log(t)));
	} else {
		tmp = (x + y) + t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = b * (a - 0.5d0)
    if ((z <= (-2d+136)) .or. (.not. (z <= 1.06d+57))) then
        tmp = t_1 + ((z + x) - (z * log(t)))
    else
        tmp = (x + y) + t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = b * (a - 0.5);
	double tmp;
	if ((z <= -2e+136) || !(z <= 1.06e+57)) {
		tmp = t_1 + ((z + x) - (z * Math.log(t)));
	} else {
		tmp = (x + y) + t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = b * (a - 0.5)
	tmp = 0
	if (z <= -2e+136) or not (z <= 1.06e+57):
		tmp = t_1 + ((z + x) - (z * math.log(t)))
	else:
		tmp = (x + y) + t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(b * Float64(a - 0.5))
	tmp = 0.0
	if ((z <= -2e+136) || !(z <= 1.06e+57))
		tmp = Float64(t_1 + Float64(Float64(z + x) - Float64(z * log(t))));
	else
		tmp = Float64(Float64(x + y) + t_1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = b * (a - 0.5);
	tmp = 0.0;
	if ((z <= -2e+136) || ~((z <= 1.06e+57)))
		tmp = t_1 + ((z + x) - (z * log(t)));
	else
		tmp = (x + y) + t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[z, -2e+136], N[Not[LessEqual[z, 1.06e+57]], $MachinePrecision]], N[(t$95$1 + N[(N[(z + x), $MachinePrecision] - N[(z * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x + y), $MachinePrecision] + t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.00000000000000012e136 or 1.06e57 < z

   1. Initial program 99.7%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 86.9%

      \[\leadsto \color{blue}{\left(\left(x + z\right) - z \cdot \log t\right)} + \left(a - 0.5\right) \cdot b \]

   if -2.00000000000000012e136 < z < 1.06e57

   1. Initial program 100.0%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 98.9%

      \[\leadsto \color{blue}{\left(x + y\right)} + \left(a - 0.5\right) \cdot b \]
3. Recombined 2 regimes into one program.

4. Final simplification 94.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2 \cdot 10^{+136} \lor \neg \left(z \leq 1.06 \cdot 10^{+57}\right):\\ \;\;\;\;b \cdot \left(a - 0.5\right) + \left(\left(z + x\right) - z \cdot \log t\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 84.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{+195} \lor \neg \left(z \leq 4.6 \cdot 10^{+117}\right):\\ \;\;\;\;z \cdot \left(1 - \log t\right) + x\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.25e+195) (not (<= z 4.6e+117)))
   (+ (* z (- 1.0 (log t))) x)
   (+ (+ x y) (* b (- a 0.5)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.25e+195) || !(z <= 4.6e+117)) {
		tmp = (z * (1.0 - log(t))) + x;
	} else {
		tmp = (x + y) + (b * (a - 0.5));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-1.25d+195)) .or. (.not. (z <= 4.6d+117))) then
        tmp = (z * (1.0d0 - log(t))) + x
    else
        tmp = (x + y) + (b * (a - 0.5d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.25e+195) || !(z <= 4.6e+117)) {
		tmp = (z * (1.0 - Math.log(t))) + x;
	} else {
		tmp = (x + y) + (b * (a - 0.5));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -1.25e+195) or not (z <= 4.6e+117):
		tmp = (z * (1.0 - math.log(t))) + x
	else:
		tmp = (x + y) + (b * (a - 0.5))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -1.25e+195) || !(z <= 4.6e+117))
		tmp = Float64(Float64(z * Float64(1.0 - log(t))) + x);
	else
		tmp = Float64(Float64(x + y) + Float64(b * Float64(a - 0.5)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -1.25e+195) || ~((z <= 4.6e+117)))
		tmp = (z * (1.0 - log(t))) + x;
	else
		tmp = (x + y) + (b * (a - 0.5));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -1.25e+195], N[Not[LessEqual[z, 4.6e+117]], $MachinePrecision]], N[(N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(N[(x + y), $MachinePrecision] + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.2499999999999999e195 or 4.59999999999999976e117 < z

   1. Initial program 99.6%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 89.0%

      \[\leadsto \color{blue}{\left(\left(x + z\right) - z \cdot \log t\right)} + \left(a - 0.5\right) \cdot b \]

   4. Taylor expanded in b around 0 68.7%

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

   5. Taylor expanded in z around 0 68.7%

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

   if -1.2499999999999999e195 < z < 4.59999999999999976e117

   1. Initial program 100.0%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 95.9%

      \[\leadsto \color{blue}{\left(x + y\right)} + \left(a - 0.5\right) \cdot b \]
3. Recombined 2 regimes into one program.

4. Final simplification 88.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{+195} \lor \neg \left(z \leq 4.6 \cdot 10^{+117}\right):\\ \;\;\;\;z \cdot \left(1 - \log t\right) + x\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 84.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -8.3 \cdot 10^{+195}:\\ \;\;\;\;z \cdot \left(1 - \log t\right) + x\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{+117}:\\ \;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\left(z + x\right) - z \cdot \log t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -8.3e+195)
   (+ (* z (- 1.0 (log t))) x)
   (if (<= z 4.2e+117) (+ (+ x y) (* b (- a 0.5))) (- (+ z x) (* z (log t))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -8.3e+195) {
		tmp = (z * (1.0 - log(t))) + x;
	} else if (z <= 4.2e+117) {
		tmp = (x + y) + (b * (a - 0.5));
	} else {
		tmp = (z + x) - (z * log(t));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (z <= (-8.3d+195)) then
        tmp = (z * (1.0d0 - log(t))) + x
    else if (z <= 4.2d+117) then
        tmp = (x + y) + (b * (a - 0.5d0))
    else
        tmp = (z + x) - (z * log(t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -8.3e+195) {
		tmp = (z * (1.0 - Math.log(t))) + x;
	} else if (z <= 4.2e+117) {
		tmp = (x + y) + (b * (a - 0.5));
	} else {
		tmp = (z + x) - (z * Math.log(t));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -8.3e+195:
		tmp = (z * (1.0 - math.log(t))) + x
	elif z <= 4.2e+117:
		tmp = (x + y) + (b * (a - 0.5))
	else:
		tmp = (z + x) - (z * math.log(t))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -8.3e+195)
		tmp = Float64(Float64(z * Float64(1.0 - log(t))) + x);
	elseif (z <= 4.2e+117)
		tmp = Float64(Float64(x + y) + Float64(b * Float64(a - 0.5)));
	else
		tmp = Float64(Float64(z + x) - Float64(z * log(t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -8.3e+195)
		tmp = (z * (1.0 - log(t))) + x;
	elseif (z <= 4.2e+117)
		tmp = (x + y) + (b * (a - 0.5));
	else
		tmp = (z + x) - (z * log(t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -8.3e+195], N[(N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[z, 4.2e+117], N[(N[(x + y), $MachinePrecision] + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(z + x), $MachinePrecision] - N[(z * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -8.29999999999999972e195

   1. Initial program 99.6%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 94.6%

      \[\leadsto \color{blue}{\left(\left(x + z\right) - z \cdot \log t\right)} + \left(a - 0.5\right) \cdot b \]

   4. Taylor expanded in b around 0 80.6%

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

   5. Taylor expanded in z around 0 80.8%

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

   if -8.29999999999999972e195 < z < 4.2000000000000002e117

   1. Initial program 100.0%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 95.9%

      \[\leadsto \color{blue}{\left(x + y\right)} + \left(a - 0.5\right) \cdot b \]

   if 4.2000000000000002e117 < z

   1. Initial program 99.7%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 86.7%

      \[\leadsto \color{blue}{\left(\left(x + z\right) - z \cdot \log t\right)} + \left(a - 0.5\right) \cdot b \]

   4. Taylor expanded in b around 0 63.7%

      \[\leadsto \color{blue}{\left(x + z\right) - z \cdot \log t} \]
3. Recombined 3 regimes into one program.

4. Final simplification 88.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -8.3 \cdot 10^{+195}:\\ \;\;\;\;z \cdot \left(1 - \log t\right) + x\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{+117}:\\ \;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\left(z + x\right) - z \cdot \log t\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 84.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9.8 \cdot 10^{+195} \lor \neg \left(z \leq 9.8 \cdot 10^{+188}\right):\\ \;\;\;\;z \cdot \left(1 - \log t\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -9.8e+195) (not (<= z 9.8e+188)))
   (* z (- 1.0 (log t)))
   (+ (+ x y) (* b (- a 0.5)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -9.8e+195) || !(z <= 9.8e+188)) {
		tmp = z * (1.0 - log(t));
	} else {
		tmp = (x + y) + (b * (a - 0.5));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-9.8d+195)) .or. (.not. (z <= 9.8d+188))) then
        tmp = z * (1.0d0 - log(t))
    else
        tmp = (x + y) + (b * (a - 0.5d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -9.8e+195) || !(z <= 9.8e+188)) {
		tmp = z * (1.0 - Math.log(t));
	} else {
		tmp = (x + y) + (b * (a - 0.5));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -9.8e+195) or not (z <= 9.8e+188):
		tmp = z * (1.0 - math.log(t))
	else:
		tmp = (x + y) + (b * (a - 0.5))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -9.8e+195) || !(z <= 9.8e+188))
		tmp = Float64(z * Float64(1.0 - log(t)));
	else
		tmp = Float64(Float64(x + y) + Float64(b * Float64(a - 0.5)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -9.8e+195) || ~((z <= 9.8e+188)))
		tmp = z * (1.0 - log(t));
	else
		tmp = (x + y) + (b * (a - 0.5));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -9.8e+195], N[Not[LessEqual[z, 9.8e+188]], $MachinePrecision]], N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x + y), $MachinePrecision] + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -9.80000000000000027e195 or 9.8e188 < z

   1. Initial program 99.5%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 94.3%

      \[\leadsto \color{blue}{\left(\left(x + z\right) - z \cdot \log t\right)} + \left(a - 0.5\right) \cdot b \]

   4. Taylor expanded in b around 0 73.4%

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

   5. Taylor expanded in z around inf 73.5%

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

   6. Taylor expanded in z around inf 69.8%

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

   if -9.80000000000000027e195 < z < 9.8e188

   1. Initial program 100.0%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 92.0%

      \[\leadsto \color{blue}{\left(x + y\right)} + \left(a - 0.5\right) \cdot b \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -9.8 \cdot 10^{+195} \lor \neg \left(z \leq 9.8 \cdot 10^{+188}\right):\\ \;\;\;\;z \cdot \left(1 - \log t\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 84.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.65 \cdot 10^{+195}:\\ \;\;\;\;z \cdot \left(1 - \log t\right)\\ \mathbf{elif}\;z \leq 10^{+186}:\\ \;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;z - z \cdot \log t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -1.65e+195)
   (* z (- 1.0 (log t)))
   (if (<= z 1e+186) (+ (+ x y) (* b (- a 0.5))) (- z (* z (log t))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -1.65e+195) {
		tmp = z * (1.0 - log(t));
	} else if (z <= 1e+186) {
		tmp = (x + y) + (b * (a - 0.5));
	} else {
		tmp = z - (z * log(t));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (z <= (-1.65d+195)) then
        tmp = z * (1.0d0 - log(t))
    else if (z <= 1d+186) then
        tmp = (x + y) + (b * (a - 0.5d0))
    else
        tmp = z - (z * log(t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -1.65e+195) {
		tmp = z * (1.0 - Math.log(t));
	} else if (z <= 1e+186) {
		tmp = (x + y) + (b * (a - 0.5));
	} else {
		tmp = z - (z * Math.log(t));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -1.65e+195:
		tmp = z * (1.0 - math.log(t))
	elif z <= 1e+186:
		tmp = (x + y) + (b * (a - 0.5))
	else:
		tmp = z - (z * math.log(t))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -1.65e+195)
		tmp = Float64(z * Float64(1.0 - log(t)));
	elseif (z <= 1e+186)
		tmp = Float64(Float64(x + y) + Float64(b * Float64(a - 0.5)));
	else
		tmp = Float64(z - Float64(z * log(t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -1.65e+195)
		tmp = z * (1.0 - log(t));
	elseif (z <= 1e+186)
		tmp = (x + y) + (b * (a - 0.5));
	else
		tmp = z - (z * log(t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -1.65e+195], N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1e+186], N[(N[(x + y), $MachinePrecision] + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z - N[(z * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.65e195

   1. Initial program 99.6%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 94.6%

      \[\leadsto \color{blue}{\left(\left(x + z\right) - z \cdot \log t\right)} + \left(a - 0.5\right) \cdot b \]

   4. Taylor expanded in b around 0 80.6%

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

   5. Taylor expanded in z around inf 80.8%

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

   6. Taylor expanded in z around inf 76.1%

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

   if -1.65e195 < z < 9.9999999999999998e185

   1. Initial program 100.0%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 92.0%

      \[\leadsto \color{blue}{\left(x + y\right)} + \left(a - 0.5\right) \cdot b \]

   if 9.9999999999999998e185 < z

   1. Initial program 99.5%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 94.1%

      \[\leadsto \color{blue}{\left(\left(x + z\right) - z \cdot \log t\right)} + \left(a - 0.5\right) \cdot b \]

   4. Taylor expanded in b around 0 68.1%

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

   5. Taylor expanded in x around 0 65.2%

      \[\leadsto \color{blue}{z - z \cdot \log t} \]
3. Recombined 3 regimes into one program.

4. Final simplification 87.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.65 \cdot 10^{+195}:\\ \;\;\;\;z \cdot \left(1 - \log t\right)\\ \mathbf{elif}\;z \leq 10^{+186}:\\ \;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;z - z \cdot \log t\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 99.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (+ z (+ x y)) (* z (log t))) (* b (- a 0.5))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((z + (x + y)) - (z * log(t))) + (b * (a - 0.5));
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((z + (x + y)) - (z * log(t))) + (b * (a - 0.5d0))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((z + (x + y)) - (z * Math.log(t))) + (b * (a - 0.5));
}

Python

def code(x, y, z, t, a, b):
	return ((z + (x + y)) - (z * math.log(t))) + (b * (a - 0.5))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(z + Float64(x + y)) - Float64(z * log(t))) + Float64(b * Float64(a - 0.5)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((z + (x + y)) - (z * log(t))) + (b * (a - 0.5));
end

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
2. Add Preprocessing

3. Final simplification 99.9%

   \[\leadsto \left(\left(z + \left(x + y\right)\right) - z \cdot \log t\right) + b \cdot \left(a - 0.5\right) \]
4. Add Preprocessing

Alternative 10: 48.0% accurate, 3.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y + -0.5 \cdot b\\ t_2 := b \cdot \left(a - 0.5\right)\\ \mathbf{if}\;b \leq -3 \cdot 10^{+35}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;b \leq -1.85 \cdot 10^{-109}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 1.32 \cdot 10^{-247}:\\ \;\;\;\;x\\ \mathbf{elif}\;b \leq 0.0017:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 8.8 \cdot 10^{+15}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ y (* -0.5 b))) (t_2 (* b (- a 0.5))))
   (if (<= b -3e+35)
     t_2
     (if (<= b -1.85e-109)
       t_1
       (if (<= b 1.32e-247)
         x
         (if (<= b 0.0017) t_1 (if (<= b 8.8e+15) x t_2)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y + (-0.5 * b);
	double t_2 = b * (a - 0.5);
	double tmp;
	if (b <= -3e+35) {
		tmp = t_2;
	} else if (b <= -1.85e-109) {
		tmp = t_1;
	} else if (b <= 1.32e-247) {
		tmp = x;
	} else if (b <= 0.0017) {
		tmp = t_1;
	} else if (b <= 8.8e+15) {
		tmp = x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = y + ((-0.5d0) * b)
    t_2 = b * (a - 0.5d0)
    if (b <= (-3d+35)) then
        tmp = t_2
    else if (b <= (-1.85d-109)) then
        tmp = t_1
    else if (b <= 1.32d-247) then
        tmp = x
    else if (b <= 0.0017d0) then
        tmp = t_1
    else if (b <= 8.8d+15) then
        tmp = x
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y + (-0.5 * b);
	double t_2 = b * (a - 0.5);
	double tmp;
	if (b <= -3e+35) {
		tmp = t_2;
	} else if (b <= -1.85e-109) {
		tmp = t_1;
	} else if (b <= 1.32e-247) {
		tmp = x;
	} else if (b <= 0.0017) {
		tmp = t_1;
	} else if (b <= 8.8e+15) {
		tmp = x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = y + (-0.5 * b)
	t_2 = b * (a - 0.5)
	tmp = 0
	if b <= -3e+35:
		tmp = t_2
	elif b <= -1.85e-109:
		tmp = t_1
	elif b <= 1.32e-247:
		tmp = x
	elif b <= 0.0017:
		tmp = t_1
	elif b <= 8.8e+15:
		tmp = x
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(y + Float64(-0.5 * b))
	t_2 = Float64(b * Float64(a - 0.5))
	tmp = 0.0
	if (b <= -3e+35)
		tmp = t_2;
	elseif (b <= -1.85e-109)
		tmp = t_1;
	elseif (b <= 1.32e-247)
		tmp = x;
	elseif (b <= 0.0017)
		tmp = t_1;
	elseif (b <= 8.8e+15)
		tmp = x;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = y + (-0.5 * b);
	t_2 = b * (a - 0.5);
	tmp = 0.0;
	if (b <= -3e+35)
		tmp = t_2;
	elseif (b <= -1.85e-109)
		tmp = t_1;
	elseif (b <= 1.32e-247)
		tmp = x;
	elseif (b <= 0.0017)
		tmp = t_1;
	elseif (b <= 8.8e+15)
		tmp = x;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(y + N[(-0.5 * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -3e+35], t$95$2, If[LessEqual[b, -1.85e-109], t$95$1, If[LessEqual[b, 1.32e-247], x, If[LessEqual[b, 0.0017], t$95$1, If[LessEqual[b, 8.8e+15], x, t$95$2]]]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.99999999999999991e35 or 8.8e15 < b

   1. Initial program 99.9%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. associate--l+ 99.9%

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

      3. associate-+r+ 99.9%

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

      4. +-commutative 99.9%

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

      5. *-lft-identity 99.9%

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

      6. metadata-eval 99.9%

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

      7. *-commutative 99.9%

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

      8. distribute-rgt-out-- 99.9%

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

      9. metadata-eval 99.9%

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

      10. fma-define 99.9%

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

      11. sub-neg 99.9%

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

      12. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 71.7%

      \[\leadsto \color{blue}{b \cdot \left(a - 0.5\right)} \]

   if -2.99999999999999991e35 < b < -1.8499999999999999e-109 or 1.3200000000000001e-247 < b < 0.00169999999999999991

   1. Initial program 99.9%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf 83.1%

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

      1. associate-*r* 83.1%

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

      2. neg-mul-1 83.1%

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

      3. mul-1-neg 83.1%

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

      4. neg-mul-1 83.1%

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

      5. sub-neg 83.1%

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

   5. Simplified 83.1%

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

   6. Taylor expanded in y around inf 44.8%

      \[\leadsto \color{blue}{y} + \left(a - 0.5\right) \cdot b \]

   7. Taylor expanded in a around 0 37.0%

      \[\leadsto y + \color{blue}{-0.5 \cdot b} \]
   8. Step-by-step derivation

      1. *-commutative 37.0%

         \[\leadsto y + \color{blue}{b \cdot -0.5} \]

   9. Simplified 37.0%

      \[\leadsto y + \color{blue}{b \cdot -0.5} \]

   if -1.8499999999999999e-109 < b < 1.3200000000000001e-247 or 0.00169999999999999991 < b < 8.8e15

   1. Initial program 99.8%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate--l+ 99.8%

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

      3. associate-+r+ 99.8%

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

      4. +-commutative 99.8%

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

      5. *-lft-identity 99.8%

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

      6. metadata-eval 99.8%

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

      7. *-commutative 99.8%

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

      8. distribute-rgt-out-- 99.9%

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

      9. metadata-eval 99.9%

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

      10. fma-define 99.9%

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

      11. sub-neg 99.9%

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

      12. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 31.1%

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

4. Final simplification 50.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -3 \cdot 10^{+35}:\\ \;\;\;\;b \cdot \left(a - 0.5\right)\\ \mathbf{elif}\;b \leq -1.85 \cdot 10^{-109}:\\ \;\;\;\;y + -0.5 \cdot b\\ \mathbf{elif}\;b \leq 1.32 \cdot 10^{-247}:\\ \;\;\;\;x\\ \mathbf{elif}\;b \leq 0.0017:\\ \;\;\;\;y + -0.5 \cdot b\\ \mathbf{elif}\;b \leq 8.8 \cdot 10^{+15}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(a - 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 46.8% accurate, 3.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := b \cdot \left(a - 0.5\right)\\ \mathbf{if}\;b \leq -2.85 \cdot 10^{+35}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq -4.7 \cdot 10^{-110}:\\ \;\;\;\;y\\ \mathbf{elif}\;b \leq 1.3 \cdot 10^{-247}:\\ \;\;\;\;x\\ \mathbf{elif}\;b \leq 1.05 \cdot 10^{-107}:\\ \;\;\;\;y\\ \mathbf{elif}\;b \leq 31500000000000:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* b (- a 0.5))))
   (if (<= b -2.85e+35)
     t_1
     (if (<= b -4.7e-110)
       y
       (if (<= b 1.3e-247)
         x
         (if (<= b 1.05e-107) y (if (<= b 31500000000000.0) x t_1)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = b * (a - 0.5);
	double tmp;
	if (b <= -2.85e+35) {
		tmp = t_1;
	} else if (b <= -4.7e-110) {
		tmp = y;
	} else if (b <= 1.3e-247) {
		tmp = x;
	} else if (b <= 1.05e-107) {
		tmp = y;
	} else if (b <= 31500000000000.0) {
		tmp = x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = b * (a - 0.5d0)
    if (b <= (-2.85d+35)) then
        tmp = t_1
    else if (b <= (-4.7d-110)) then
        tmp = y
    else if (b <= 1.3d-247) then
        tmp = x
    else if (b <= 1.05d-107) then
        tmp = y
    else if (b <= 31500000000000.0d0) then
        tmp = x
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = b * (a - 0.5);
	double tmp;
	if (b <= -2.85e+35) {
		tmp = t_1;
	} else if (b <= -4.7e-110) {
		tmp = y;
	} else if (b <= 1.3e-247) {
		tmp = x;
	} else if (b <= 1.05e-107) {
		tmp = y;
	} else if (b <= 31500000000000.0) {
		tmp = x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = b * (a - 0.5)
	tmp = 0
	if b <= -2.85e+35:
		tmp = t_1
	elif b <= -4.7e-110:
		tmp = y
	elif b <= 1.3e-247:
		tmp = x
	elif b <= 1.05e-107:
		tmp = y
	elif b <= 31500000000000.0:
		tmp = x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(b * Float64(a - 0.5))
	tmp = 0.0
	if (b <= -2.85e+35)
		tmp = t_1;
	elseif (b <= -4.7e-110)
		tmp = y;
	elseif (b <= 1.3e-247)
		tmp = x;
	elseif (b <= 1.05e-107)
		tmp = y;
	elseif (b <= 31500000000000.0)
		tmp = x;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = b * (a - 0.5);
	tmp = 0.0;
	if (b <= -2.85e+35)
		tmp = t_1;
	elseif (b <= -4.7e-110)
		tmp = y;
	elseif (b <= 1.3e-247)
		tmp = x;
	elseif (b <= 1.05e-107)
		tmp = y;
	elseif (b <= 31500000000000.0)
		tmp = x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -2.85e+35], t$95$1, If[LessEqual[b, -4.7e-110], y, If[LessEqual[b, 1.3e-247], x, If[LessEqual[b, 1.05e-107], y, If[LessEqual[b, 31500000000000.0], x, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.84999999999999997e35 or 3.15e13 < b

   1. Initial program 99.9%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. associate--l+ 99.9%

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

      3. associate-+r+ 99.9%

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

      4. +-commutative 99.9%

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

      5. *-lft-identity 99.9%

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

      6. metadata-eval 99.9%

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

      7. *-commutative 99.9%

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

      8. distribute-rgt-out-- 99.9%

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

      9. metadata-eval 99.9%

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

      10. fma-define 99.9%

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

      11. sub-neg 99.9%

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

      12. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 71.7%

      \[\leadsto \color{blue}{b \cdot \left(a - 0.5\right)} \]

   if -2.84999999999999997e35 < b < -4.69999999999999992e-110 or 1.3e-247 < b < 1.05e-107

   1. Initial program 99.9%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. associate--l+ 100.0%

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

      3. associate-+r+ 100.0%

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

      4. +-commutative 100.0%

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

      5. *-lft-identity 100.0%

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

      6. metadata-eval 100.0%

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

      7. *-commutative 100.0%

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

      8. distribute-rgt-out-- 99.9%

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

      9. metadata-eval 99.9%

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

      10. fma-define 99.9%

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

      11. sub-neg 99.9%

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

      12. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 36.5%

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

   if -4.69999999999999992e-110 < b < 1.3e-247 or 1.05e-107 < b < 3.15e13

   1. Initial program 99.8%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate--l+ 99.8%

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

      3. associate-+r+ 99.8%

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

      4. +-commutative 99.8%

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

      5. *-lft-identity 99.8%

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

      6. metadata-eval 99.8%

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

      7. *-commutative 99.8%

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

      8. distribute-rgt-out-- 99.8%

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

      9. metadata-eval 99.8%

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

      10. fma-define 99.8%

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

      11. sub-neg 99.8%

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

      12. metadata-eval 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 36.1%

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

Alternative 12: 38.1% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -9.8 \cdot 10^{+76}:\\ \;\;\;\;a \cdot b\\ \mathbf{elif}\;a \leq -8 \cdot 10^{-217}:\\ \;\;\;\;y\\ \mathbf{elif}\;a \leq 7.8 \cdot 10^{-156}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 8.6 \cdot 10^{-28}:\\ \;\;\;\;-0.5 \cdot b\\ \mathbf{elif}\;a \leq 4 \cdot 10^{+48}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;a \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= a -9.8e+76)
   (* a b)
   (if (<= a -8e-217)
     y
     (if (<= a 7.8e-156)
       x
       (if (<= a 8.6e-28) (* -0.5 b) (if (<= a 4e+48) x (* a b)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -9.8e+76) {
		tmp = a * b;
	} else if (a <= -8e-217) {
		tmp = y;
	} else if (a <= 7.8e-156) {
		tmp = x;
	} else if (a <= 8.6e-28) {
		tmp = -0.5 * b;
	} else if (a <= 4e+48) {
		tmp = x;
	} else {
		tmp = a * b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-9.8d+76)) then
        tmp = a * b
    else if (a <= (-8d-217)) then
        tmp = y
    else if (a <= 7.8d-156) then
        tmp = x
    else if (a <= 8.6d-28) then
        tmp = (-0.5d0) * b
    else if (a <= 4d+48) then
        tmp = x
    else
        tmp = a * b
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -9.8e+76) {
		tmp = a * b;
	} else if (a <= -8e-217) {
		tmp = y;
	} else if (a <= 7.8e-156) {
		tmp = x;
	} else if (a <= 8.6e-28) {
		tmp = -0.5 * b;
	} else if (a <= 4e+48) {
		tmp = x;
	} else {
		tmp = a * b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if a <= -9.8e+76:
		tmp = a * b
	elif a <= -8e-217:
		tmp = y
	elif a <= 7.8e-156:
		tmp = x
	elif a <= 8.6e-28:
		tmp = -0.5 * b
	elif a <= 4e+48:
		tmp = x
	else:
		tmp = a * b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (a <= -9.8e+76)
		tmp = Float64(a * b);
	elseif (a <= -8e-217)
		tmp = y;
	elseif (a <= 7.8e-156)
		tmp = x;
	elseif (a <= 8.6e-28)
		tmp = Float64(-0.5 * b);
	elseif (a <= 4e+48)
		tmp = x;
	else
		tmp = Float64(a * b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (a <= -9.8e+76)
		tmp = a * b;
	elseif (a <= -8e-217)
		tmp = y;
	elseif (a <= 7.8e-156)
		tmp = x;
	elseif (a <= 8.6e-28)
		tmp = -0.5 * b;
	elseif (a <= 4e+48)
		tmp = x;
	else
		tmp = a * b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[a, -9.8e+76], N[(a * b), $MachinePrecision], If[LessEqual[a, -8e-217], y, If[LessEqual[a, 7.8e-156], x, If[LessEqual[a, 8.6e-28], N[(-0.5 * b), $MachinePrecision], If[LessEqual[a, 4e+48], x, N[(a * b), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if a < -9.80000000000000053e76 or 4.00000000000000018e48 < a

   1. Initial program 99.9%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. associate--l+ 99.9%

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

      3. associate-+r+ 99.9%

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

      4. +-commutative 99.9%

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

      5. *-lft-identity 99.9%

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

      6. metadata-eval 99.9%

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

      7. *-commutative 99.9%

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

      8. distribute-rgt-out-- 99.9%

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

      9. metadata-eval 99.9%

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

      10. fma-define 99.9%

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

      11. sub-neg 99.9%

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

      12. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in a around inf 53.8%

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

      1. *-commutative 53.8%

         \[\leadsto \color{blue}{b \cdot a} \]

   7. Simplified 53.8%

      \[\leadsto \color{blue}{b \cdot a} \]

   if -9.80000000000000053e76 < a < -8.00000000000000066e-217

   1. Initial program 99.8%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate--l+ 99.9%

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

      3. associate-+r+ 99.9%

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

      4. +-commutative 99.9%

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

      5. *-lft-identity 99.9%

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

      6. metadata-eval 99.9%

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

      7. *-commutative 99.9%

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

      8. distribute-rgt-out-- 99.9%

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

      9. metadata-eval 99.9%

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

      10. fma-define 99.9%

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

      11. sub-neg 99.9%

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

      12. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 33.0%

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

   if -8.00000000000000066e-217 < a < 7.8000000000000002e-156 or 8.6e-28 < a < 4.00000000000000018e48

   1. Initial program 99.8%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate--l+ 99.9%

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

      3. associate-+r+ 99.9%

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

      4. +-commutative 99.9%

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

      5. *-lft-identity 99.9%

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

      6. metadata-eval 99.9%

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

      7. *-commutative 99.9%

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

      8. distribute-rgt-out-- 99.9%

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

      9. metadata-eval 99.9%

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

      10. fma-define 99.9%

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

      11. sub-neg 99.9%

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

      12. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 26.6%

      \[\leadsto \color{blue}{x} \]

   if 7.8000000000000002e-156 < a < 8.6e-28

   1. Initial program 99.8%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate--l+ 99.8%

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

      3. associate-+r+ 99.8%

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

      4. +-commutative 99.8%

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

      5. *-lft-identity 99.8%

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

      6. metadata-eval 99.8%

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

      7. *-commutative 99.8%

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

      8. distribute-rgt-out-- 99.9%

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

      9. metadata-eval 99.9%

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

      10. fma-define 99.9%

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

      11. sub-neg 99.9%

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

      12. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 36.4%

      \[\leadsto \color{blue}{b \cdot \left(a - 0.5\right)} \]

   6. Taylor expanded in a around 0 36.4%

      \[\leadsto \color{blue}{-0.5 \cdot b} \]
3. Recombined 4 regimes into one program.

4. Final simplification 40.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -9.8 \cdot 10^{+76}:\\ \;\;\;\;a \cdot b\\ \mathbf{elif}\;a \leq -8 \cdot 10^{-217}:\\ \;\;\;\;y\\ \mathbf{elif}\;a \leq 7.8 \cdot 10^{-156}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 8.6 \cdot 10^{-28}:\\ \;\;\;\;-0.5 \cdot b\\ \mathbf{elif}\;a \leq 4 \cdot 10^{+48}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;a \cdot b\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 58.4% accurate, 8.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := b \cdot \left(a - 0.5\right)\\ \mathbf{if}\;x + y \leq 5 \cdot 10^{-192}:\\ \;\;\;\;x + t\_1\\ \mathbf{else}:\\ \;\;\;\;y + t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* b (- a 0.5)))) (if (<= (+ x y) 5e-192) (+ x t_1) (+ y t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = b * (a - 0.5);
	double tmp;
	if ((x + y) <= 5e-192) {
		tmp = x + t_1;
	} else {
		tmp = y + t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = b * (a - 0.5d0)
    if ((x + y) <= 5d-192) then
        tmp = x + t_1
    else
        tmp = y + t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = b * (a - 0.5);
	double tmp;
	if ((x + y) <= 5e-192) {
		tmp = x + t_1;
	} else {
		tmp = y + t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = b * (a - 0.5)
	tmp = 0
	if (x + y) <= 5e-192:
		tmp = x + t_1
	else:
		tmp = y + t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(b * Float64(a - 0.5))
	tmp = 0.0
	if (Float64(x + y) <= 5e-192)
		tmp = Float64(x + t_1);
	else
		tmp = Float64(y + t_1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = b * (a - 0.5);
	tmp = 0.0;
	if ((x + y) <= 5e-192)
		tmp = x + t_1;
	else
		tmp = y + t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x + y), $MachinePrecision], 5e-192], N[(x + t$95$1), $MachinePrecision], N[(y + t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 5.0000000000000001e-192

   1. Initial program 99.9%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf 84.4%

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

      1. associate-*r* 84.4%

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

      2. neg-mul-1 84.4%

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

      3. mul-1-neg 84.4%

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

      4. neg-mul-1 84.4%

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

      5. sub-neg 84.4%

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

   5. Simplified 84.4%

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

   6. Taylor expanded in x around inf 57.5%

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

   if 5.0000000000000001e-192 < (+.f64 x y)

   1. Initial program 99.9%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf 85.2%

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

      1. associate-*r* 85.2%

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

      2. neg-mul-1 85.2%

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

      3. mul-1-neg 85.2%

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

      4. neg-mul-1 85.2%

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

      5. sub-neg 85.2%

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

   5. Simplified 85.2%

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

   6. Taylor expanded in y around inf 63.8%

      \[\leadsto \color{blue}{y} + \left(a - 0.5\right) \cdot b \]
3. Recombined 2 regimes into one program.

4. Final simplification 60.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \leq 5 \cdot 10^{-192}:\\ \;\;\;\;x + b \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;y + b \cdot \left(a - 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 60.7% accurate, 9.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 4.9 \cdot 10^{+78}:\\ \;\;\;\;x + b \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;y + -0.5 \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y 4.9e+78) (+ x (* b (- a 0.5))) (+ y (* -0.5 b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= 4.9e+78) {
		tmp = x + (b * (a - 0.5));
	} else {
		tmp = y + (-0.5 * b);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (y <= 4.9d+78) then
        tmp = x + (b * (a - 0.5d0))
    else
        tmp = y + ((-0.5d0) * b)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= 4.9e+78) {
		tmp = x + (b * (a - 0.5));
	} else {
		tmp = y + (-0.5 * b);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= 4.9e+78:
		tmp = x + (b * (a - 0.5))
	else:
		tmp = y + (-0.5 * b)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= 4.9e+78)
		tmp = Float64(x + Float64(b * Float64(a - 0.5)));
	else
		tmp = Float64(y + Float64(-0.5 * b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= 4.9e+78)
		tmp = x + (b * (a - 0.5));
	else
		tmp = y + (-0.5 * b);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, 4.9e+78], N[(x + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y + N[(-0.5 * b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 4.9000000000000002e78

   1. Initial program 99.9%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf 86.5%

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

      1. associate-*r* 86.5%

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

      2. neg-mul-1 86.5%

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

      3. mul-1-neg 86.5%

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

      4. neg-mul-1 86.5%

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

      5. sub-neg 86.5%

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

   5. Simplified 86.5%

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

   6. Taylor expanded in x around inf 63.7%

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

   if 4.9000000000000002e78 < y

   1. Initial program 99.8%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf 77.9%

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

      1. associate-*r* 77.9%

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

      2. neg-mul-1 77.9%

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

      3. mul-1-neg 77.9%

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

      4. neg-mul-1 77.9%

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

      5. sub-neg 77.9%

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

   5. Simplified 77.9%

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

   6. Taylor expanded in y around inf 75.6%

      \[\leadsto \color{blue}{y} + \left(a - 0.5\right) \cdot b \]

   7. Taylor expanded in a around 0 58.7%

      \[\leadsto y + \color{blue}{-0.5 \cdot b} \]
   8. Step-by-step derivation

      1. *-commutative 58.7%

         \[\leadsto y + \color{blue}{b \cdot -0.5} \]

   9. Simplified 58.7%

      \[\leadsto y + \color{blue}{b \cdot -0.5} \]
3. Recombined 2 regimes into one program.

4. Final simplification 62.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 4.9 \cdot 10^{+78}:\\ \;\;\;\;x + b \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;y + -0.5 \cdot b\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 78.9% accurate, 12.8× speedup

Math

\[\begin{array}{l} \\ \left(x + y\right) + b \cdot \left(a - 0.5\right) \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (+ (+ x y) (* b (- a 0.5))))

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (x + y) + (b * (a - 0.5d0))
end function

Java

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

Python

def code(x, y, z, t, a, b):
	return (x + y) + (b * (a - 0.5))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(x + y) + Float64(b * Float64(a - 0.5)))
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(x + y), $MachinePrecision] + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
2. Add Preprocessing

3. Taylor expanded in z around 0 80.2%

   \[\leadsto \color{blue}{\left(x + y\right)} + \left(a - 0.5\right) \cdot b \]

4. Final simplification 80.2%

   \[\leadsto \left(x + y\right) + b \cdot \left(a - 0.5\right) \]
5. Add Preprocessing

Alternative 16: 27.8% accurate, 19.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 62000000000000:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (if (<= y 62000000000000.0) x y))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= 62000000000000.0) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (y <= 62000000000000.0d0) then
        tmp = x
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= 62000000000000.0) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= 62000000000000.0:
		tmp = x
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= 62000000000000.0)
		tmp = x;
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= 62000000000000.0)
		tmp = x;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, 62000000000000.0], x, y]

Derivation

1. Split input into 2 regimes

2. if y < 6.2e13

   1. Initial program 99.9%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. associate--l+ 99.9%

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

      3. associate-+r+ 99.9%

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

      4. +-commutative 99.9%

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

      5. *-lft-identity 99.9%

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

      6. metadata-eval 99.9%

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

      7. *-commutative 99.9%

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

      8. distribute-rgt-out-- 99.9%

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

      9. metadata-eval 99.9%

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

      10. fma-define 99.9%

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

      11. sub-neg 99.9%

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

      12. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 26.4%

      \[\leadsto \color{blue}{x} \]

   if 6.2e13 < y

   1. Initial program 99.8%

      \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate--l+ 99.9%

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

      3. associate-+r+ 99.9%

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

      4. +-commutative 99.9%

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

      5. *-lft-identity 99.9%

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

      6. metadata-eval 99.9%

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

      7. *-commutative 99.9%

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

      8. distribute-rgt-out-- 99.9%

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

      9. metadata-eval 99.9%

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

      10. fma-define 99.9%

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

      11. sub-neg 99.9%

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

      12. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 46.6%

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

Alternative 17: 21.0% accurate, 115.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b \]
2. Step-by-step derivation

   1. +-commutative 99.9%

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

   2. associate--l+ 99.9%

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

   3. associate-+r+ 99.9%

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

   4. +-commutative 99.9%

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

   5. *-lft-identity 99.9%

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

   6. metadata-eval 99.9%

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

   7. *-commutative 99.9%

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

   8. distribute-rgt-out-- 99.9%

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

   9. metadata-eval 99.9%

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

   10. fma-define 99.9%

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

   11. sub-neg 99.9%

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

   12. metadata-eval 99.9%

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

3. Simplified 99.9%

   \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right) + \mathsf{fma}\left(a + -0.5, b, x + y\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around inf 22.5%

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

Developer target: 99.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \left(\left(x + y\right) + \frac{\left(1 - {\log t}^{2}\right) \cdot z}{1 + \log t}\right) + \left(a - 0.5\right) \cdot b \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+
  (+ (+ x y) (/ (* (- 1.0 (pow (log t) 2.0)) z) (+ 1.0 (log t))))
  (* (- a 0.5) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((x + y) + (((1.0 - pow(log(t), 2.0)) * z) / (1.0 + log(t)))) + ((a - 0.5) * b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((x + y) + (((1.0d0 - (log(t) ** 2.0d0)) * z) / (1.0d0 + log(t)))) + ((a - 0.5d0) * b)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((x + y) + (((1.0 - Math.pow(Math.log(t), 2.0)) * z) / (1.0 + Math.log(t)))) + ((a - 0.5) * b);
}

Python

def code(x, y, z, t, a, b):
	return ((x + y) + (((1.0 - math.pow(math.log(t), 2.0)) * z) / (1.0 + math.log(t)))) + ((a - 0.5) * b)

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(x + y) + Float64(Float64(Float64(1.0 - (log(t) ^ 2.0)) * z) / Float64(1.0 + log(t)))) + Float64(Float64(a - 0.5) * b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((x + y) + (((1.0 - (log(t) ^ 2.0)) * z) / (1.0 + log(t)))) + ((a - 0.5) * b);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x + y), $MachinePrecision] + N[(N[(N[(1.0 - N[Power[N[Log[t], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision] / N[(1.0 + N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a - 0.5), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024103 
(FPCore (x y z t a b)
  :name "Numeric.SpecFunctions:logBeta from math-functions-0.1.5.2, A"
  :precision binary64

  :alt
  (+ (+ (+ x y) (/ (* (- 1.0 (pow (log t) 2.0)) z) (+ 1.0 (log t)))) (* (- a 0.5) b))

  (+ (- (+ (+ x y) z) (* z (log t))) (* (- a 0.5) b)))