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

Percentage Accurate: 99.8% → 99.8%

Time: 9.2s

Alternatives: 15

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.8% 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: 90.7% 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 -2 \cdot 10^{+118}:\\ \;\;\;\;\left(x + y\right) + t\_1\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+91}:\\ \;\;\;\;x + \left(z \cdot \left(1 - \log t\right) + y\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b, a + -0.5, x + y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* b (- a 0.5))))
   (if (<= t_1 -2e+118)
     (+ (+ x y) t_1)
     (if (<= t_1 5e+91)
       (+ x (+ (* z (- 1.0 (log t))) y))
       (fma b (+ a -0.5) (+ x 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 <= -2e+118) {
		tmp = (x + y) + t_1;
	} else if (t_1 <= 5e+91) {
		tmp = x + ((z * (1.0 - log(t))) + y);
	} else {
		tmp = fma(b, (a + -0.5), (x + 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 <= -2e+118)
		tmp = Float64(Float64(x + y) + t_1);
	elseif (t_1 <= 5e+91)
		tmp = Float64(x + Float64(Float64(z * Float64(1.0 - log(t))) + y));
	else
		tmp = fma(b, Float64(a + -0.5), Float64(x + y));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < -1.99999999999999993e118

   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.2%

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

   if -1.99999999999999993e118 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < 5.0000000000000002e91

   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 0 92.8%

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

   if 5.0000000000000002e91 < (*.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. Step-by-step derivation

      1. +-commutative 100.0%

         \[\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-- 100.0%

         \[\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 100.0%

         \[\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 100.0%

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

      11. sub-neg 100.0%

          \[\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 100.0%

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

   3. Simplified 100.0%

      \[\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 z around 0 93.5%

      \[\leadsto \color{blue}{x + \left(y + b \cdot \left(a - 0.5\right)\right)} \]
   6. Step-by-step derivation

      1. +-commutative 93.5%

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

      2. +-commutative 93.5%

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

      3. sub-neg 93.5%

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

      4. metadata-eval 93.5%

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

      5. *-commutative 93.5%

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

      6. associate-+r+ 93.5%

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

      7. +-commutative 93.5%

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

      8. *-commutative 93.5%

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

      9. fma-define 93.5%

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

   7. Simplified 93.5%

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

4. Final simplification 93.7%

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

Alternative 3: 82.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((x + y) <= 10000000000000.0) {
		tmp = x + ((z * (1.0 - log(t))) + (b * (a - 0.5)));
	} else {
		tmp = fma(b, (a + -0.5), (x + y));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(x + y) <= 10000000000000.0)
		tmp = Float64(x + Float64(Float64(z * Float64(1.0 - log(t))) + Float64(b * Float64(a - 0.5))));
	else
		tmp = fma(b, Float64(a + -0.5), Float64(x + y));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 1e13

   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 0 81.2%

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

   if 1e13 < (+.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. 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 100.0%

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

      11. sub-neg 100.0%

          \[\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 100.0%

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

   3. Simplified 100.0%

      \[\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 z around 0 84.6%

      \[\leadsto \color{blue}{x + \left(y + b \cdot \left(a - 0.5\right)\right)} \]
   6. Step-by-step derivation

      1. +-commutative 84.6%

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

      2. +-commutative 84.6%

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

      3. sub-neg 84.6%

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

      4. metadata-eval 84.6%

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

      5. *-commutative 84.6%

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

      6. associate-+r+ 84.6%

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

      7. +-commutative 84.6%

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

      8. *-commutative 84.6%

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

      9. fma-define 84.6%

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

   7. Simplified 84.6%

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

4. Final simplification 82.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \leq 10000000000000:\\ \;\;\;\;x + \left(z \cdot \left(1 - \log t\right) + b \cdot \left(a - 0.5\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b, a + -0.5, x + y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 83.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.02 \cdot 10^{+247} \lor \neg \left(z \leq 7.8 \cdot 10^{+194}\right):\\ \;\;\;\;z \cdot \left(1 - \log t\right) + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b, a + -0.5, x + y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.02e+247) (not (<= z 7.8e+194)))
   (+ (* z (- 1.0 (log t))) x)
   (fma b (+ a -0.5) (+ x y))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.02e+247) || !(z <= 7.8e+194)) {
		tmp = (z * (1.0 - log(t))) + x;
	} else {
		tmp = fma(b, (a + -0.5), (x + y));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -1.02e+247) || !(z <= 7.8e+194))
		tmp = Float64(Float64(z * Float64(1.0 - log(t))) + x);
	else
		tmp = fma(b, Float64(a + -0.5), Float64(x + y));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.02e247 or 7.80000000000000031e194 < 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. Step-by-step derivation

      1. +-commutative 99.7%

         \[\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.7%

         \[\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.7%

         \[\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.7%

         \[\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.7%

         \[\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.7%

         \[\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.7%

         \[\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 y around 0 92.9%

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

   6. Taylor expanded in b around 0 78.7%

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

   if -1.02e247 < z < 7.80000000000000031e194

   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 z around 0 87.4%

      \[\leadsto \color{blue}{x + \left(y + b \cdot \left(a - 0.5\right)\right)} \]
   6. Step-by-step derivation

      1. +-commutative 87.4%

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

      2. +-commutative 87.4%

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

      3. sub-neg 87.4%

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

      4. metadata-eval 87.4%

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

      5. *-commutative 87.4%

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

      6. associate-+r+ 87.4%

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

      7. +-commutative 87.4%

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

      8. *-commutative 87.4%

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

      9. fma-define 87.4%

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

   7. Simplified 87.4%

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

4. Final simplification 86.5%

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

Alternative 5: 83.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.16 \cdot 10^{+246} \lor \neg \left(z \leq 1.35 \cdot 10^{+203}\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.16e+246) (not (<= z 1.35e+203)))
   (+ (* 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.16e+246) || !(z <= 1.35e+203)) {
		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.16d+246)) .or. (.not. (z <= 1.35d+203))) 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.16e+246) || !(z <= 1.35e+203)) {
		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.16e+246) or not (z <= 1.35e+203):
		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.16e+246) || !(z <= 1.35e+203))
		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.16e+246) || ~((z <= 1.35e+203)))
		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.16e+246], N[Not[LessEqual[z, 1.35e+203]], $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.1600000000000001e246 or 1.35e203 < 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. Step-by-step derivation

      1. +-commutative 99.7%

         \[\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.7%

         \[\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.7%

         \[\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.7%

         \[\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.7%

         \[\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.7%

         \[\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.7%

         \[\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 y around 0 92.9%

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

   6. Taylor expanded in b around 0 78.7%

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

   if -1.1600000000000001e246 < z < 1.35e203

   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 87.4%

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

4. Final simplification 86.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.16 \cdot 10^{+246} \lor \neg \left(z \leq 1.35 \cdot 10^{+203}\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: 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 7: 28.6% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.2 \cdot 10^{+111}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -4 \cdot 10^{-25} \lor \neg \left(x \leq -3.2 \cdot 10^{-145}\right) \land x \leq 220000000:\\ \;\;\;\;a \cdot b\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= x -5.2e+111)
   x
   (if (or (<= x -4e-25) (and (not (<= x -3.2e-145)) (<= x 220000000.0)))
     (* a b)
     y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (x <= -5.2e+111) {
		tmp = x;
	} else if ((x <= -4e-25) || (!(x <= -3.2e-145) && (x <= 220000000.0))) {
		tmp = a * b;
	} 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 (x <= (-5.2d+111)) then
        tmp = x
    else if ((x <= (-4d-25)) .or. (.not. (x <= (-3.2d-145))) .and. (x <= 220000000.0d0)) then
        tmp = a * b
    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 (x <= -5.2e+111) {
		tmp = x;
	} else if ((x <= -4e-25) || (!(x <= -3.2e-145) && (x <= 220000000.0))) {
		tmp = a * b;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if x <= -5.2e+111:
		tmp = x
	elif (x <= -4e-25) or (not (x <= -3.2e-145) and (x <= 220000000.0)):
		tmp = a * b
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (x <= -5.2e+111)
		tmp = x;
	elseif ((x <= -4e-25) || (!(x <= -3.2e-145) && (x <= 220000000.0)))
		tmp = Float64(a * b);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (x <= -5.2e+111)
		tmp = x;
	elseif ((x <= -4e-25) || (~((x <= -3.2e-145)) && (x <= 220000000.0)))
		tmp = a * b;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[x, -5.2e+111], x, If[Or[LessEqual[x, -4e-25], And[N[Not[LessEqual[x, -3.2e-145]], $MachinePrecision], LessEqual[x, 220000000.0]]], N[(a * b), $MachinePrecision], y]]

Derivation

1. Split input into 3 regimes

2. if x < -5.1999999999999997e111

   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. Step-by-step derivation

      1. +-commutative 100.0%

         \[\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-- 100.0%

         \[\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 100.0%

         \[\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 100.0%

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

      11. sub-neg 100.0%

          \[\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 100.0%

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

   3. Simplified 100.0%

      \[\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 62.3%

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

   if -5.1999999999999997e111 < x < -4.00000000000000015e-25 or -3.20000000000000008e-145 < x < 2.2e8

   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 a around inf 34.1%

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

      1. *-commutative 34.1%

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

   7. Simplified 34.1%

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

   if -4.00000000000000015e-25 < x < -3.20000000000000008e-145 or 2.2e8 < x

   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-- 100.0%

         \[\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 100.0%

         \[\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 100.0%

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

      11. sub-neg 100.0%

          \[\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 100.0%

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

   3. Simplified 100.0%

      \[\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 17.8%

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

4. Final simplification 31.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.2 \cdot 10^{+111}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -4 \cdot 10^{-25} \lor \neg \left(x \leq -3.2 \cdot 10^{-145}\right) \land x \leq 220000000:\\ \;\;\;\;a \cdot b\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 62.9% accurate, 6.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.6 \cdot 10^{+56} \lor \neg \left(b \leq 2.5 \cdot 10^{+75}\right):\\ \;\;\;\;b \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(y + -0.5 \cdot b\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -1.6e+56) (not (<= b 2.5e+75)))
   (* b (- a 0.5))
   (+ x (+ y (* -0.5 b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -1.6e+56) || !(b <= 2.5e+75)) {
		tmp = b * (a - 0.5);
	} else {
		tmp = x + (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 ((b <= (-1.6d+56)) .or. (.not. (b <= 2.5d+75))) then
        tmp = b * (a - 0.5d0)
    else
        tmp = x + (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 ((b <= -1.6e+56) || !(b <= 2.5e+75)) {
		tmp = b * (a - 0.5);
	} else {
		tmp = x + (y + (-0.5 * b));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -1.6e+56) or not (b <= 2.5e+75):
		tmp = b * (a - 0.5)
	else:
		tmp = x + (y + (-0.5 * b))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -1.6e+56) || !(b <= 2.5e+75))
		tmp = Float64(b * Float64(a - 0.5));
	else
		tmp = Float64(x + 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 ((b <= -1.6e+56) || ~((b <= 2.5e+75)))
		tmp = b * (a - 0.5);
	else
		tmp = x + (y + (-0.5 * b));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -1.6e+56], N[Not[LessEqual[b, 2.5e+75]], $MachinePrecision]], N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision], N[(x + N[(y + N[(-0.5 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.60000000000000002e56 or 2.5000000000000001e75 < 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+ 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-- 100.0%

         \[\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 100.0%

         \[\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 100.0%

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

      11. sub-neg 100.0%

          \[\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 100.0%

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

   3. Simplified 100.0%

      \[\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 82.6%

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

   if -1.60000000000000002e56 < b < 2.5000000000000001e75

   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 0 71.7%

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

   4. Taylor expanded in a around 0 59.8%

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

4. Final simplification 68.5%

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

Alternative 9: 61.3% accurate, 7.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.3 \cdot 10^{+56} \lor \neg \left(b \leq 4.2 \cdot 10^{+71}\right):\\ \;\;\;\;b \cdot \left(a - 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -2.3e+56) (not (<= b 4.2e+71))) (* b (- a 0.5)) (+ x y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -2.3e+56) || !(b <= 4.2e+71)) {
		tmp = b * (a - 0.5);
	} else {
		tmp = x + 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 ((b <= (-2.3d+56)) .or. (.not. (b <= 4.2d+71))) then
        tmp = b * (a - 0.5d0)
    else
        tmp = x + 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 ((b <= -2.3e+56) || !(b <= 4.2e+71)) {
		tmp = b * (a - 0.5);
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -2.3e+56) or not (b <= 4.2e+71):
		tmp = b * (a - 0.5)
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -2.3e+56) || !(b <= 4.2e+71))
		tmp = Float64(b * Float64(a - 0.5));
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -2.3e+56) || ~((b <= 4.2e+71)))
		tmp = b * (a - 0.5);
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -2.3e+56], N[Not[LessEqual[b, 4.2e+71]], $MachinePrecision]], N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision], N[(x + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -2.30000000000000015e56 or 4.19999999999999978e71 < 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+ 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-- 100.0%

         \[\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 100.0%

         \[\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 100.0%

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

      11. sub-neg 100.0%

          \[\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 100.0%

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

   3. Simplified 100.0%

      \[\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 82.6%

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

   if -2.30000000000000015e56 < b < 4.19999999999999978e71

   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 0 71.7%

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

   4. Taylor expanded in b around 0 58.3%

      \[\leadsto \color{blue}{x + y} \]
   5. Step-by-step derivation

      1. +-commutative 58.3%

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

   6. Simplified 58.3%

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

4. Final simplification 67.6%

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

Alternative 10: 51.7% accurate, 8.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5.5 \cdot 10^{+56} \lor \neg \left(b \leq 5.5 \cdot 10^{+80}\right):\\ \;\;\;\;a \cdot b\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -5.5e+56) (not (<= b 5.5e+80))) (* a b) (+ x y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -5.5e+56) || !(b <= 5.5e+80)) {
		tmp = a * b;
	} else {
		tmp = x + 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 ((b <= (-5.5d+56)) .or. (.not. (b <= 5.5d+80))) then
        tmp = a * b
    else
        tmp = x + 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 ((b <= -5.5e+56) || !(b <= 5.5e+80)) {
		tmp = a * b;
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -5.5e+56) or not (b <= 5.5e+80):
		tmp = a * b
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -5.5e+56) || !(b <= 5.5e+80))
		tmp = Float64(a * b);
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -5.5e+56) || ~((b <= 5.5e+80)))
		tmp = a * b;
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -5.5e+56], N[Not[LessEqual[b, 5.5e+80]], $MachinePrecision]], N[(a * b), $MachinePrecision], N[(x + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -5.5000000000000002e56 or 5.49999999999999967e80 < 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+ 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-- 100.0%

         \[\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 100.0%

         \[\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 100.0%

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

      11. sub-neg 100.0%

          \[\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 100.0%

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

   3. Simplified 100.0%

      \[\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 59.0%

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

      1. *-commutative 59.0%

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

   7. Simplified 59.0%

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

   if -5.5000000000000002e56 < b < 5.49999999999999967e80

   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 0 71.7%

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

   4. Taylor expanded in b around 0 58.3%

      \[\leadsto \color{blue}{x + y} \]
   5. Step-by-step derivation

      1. +-commutative 58.3%

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

   6. Simplified 58.3%

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

4. Final simplification 58.6%

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

Alternative 11: 63.8% accurate, 9.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := b \cdot \left(a - 0.5\right)\\ \mathbf{if}\;y \leq 4400:\\ \;\;\;\;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 (<= y 4400.0) (+ 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 (y <= 4400.0) {
		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 (y <= 4400.0d0) 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 (y <= 4400.0) {
		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 y <= 4400.0:
		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 (y <= 4400.0)
		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 (y <= 4400.0)
		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[y, 4400.0], N[(x + t$95$1), $MachinePrecision], N[(y + t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < 4400

   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 y around 0 85.6%

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

   6. Taylor expanded in b around -inf 75.3%

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

      1. associate-*r* 75.3%

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

      2. mul-1-neg 75.3%

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

      3. +-commutative 75.3%

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

      4. mul-1-neg 75.3%

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

      5. unsub-neg 75.3%

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

   8. Simplified 75.2%

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

   9. Taylor expanded in z around 0 64.5%

      \[\leadsto \color{blue}{x + -1 \cdot \left(b \cdot \left(0.5 - a\right)\right)} \]
   10. Step-by-step derivation

       1. mul-1-neg 64.5%

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

       2. unsub-neg 64.5%

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

   11. Simplified 64.5%

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

   if 4400 < 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 0 87.0%

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

   4. Taylor expanded in x around 0 72.8%

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

4. Final simplification 66.5%

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

Alternative 12: 61.8% accurate, 9.6× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (x <= -1.4e+112) {
		tmp = x + (y + (-0.5 * b));
	} else {
		tmp = 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 (x <= (-1.4d+112)) then
        tmp = x + (y + ((-0.5d0) * b))
    else
        tmp = 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 (x <= -1.4e+112) {
		tmp = x + (y + (-0.5 * b));
	} else {
		tmp = y + (b * (a - 0.5));
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (x <= -1.4e+112)
		tmp = Float64(x + Float64(y + Float64(-0.5 * b)));
	else
		tmp = Float64(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 (x <= -1.4e+112)
		tmp = x + (y + (-0.5 * b));
	else
		tmp = y + (b * (a - 0.5));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.4000000000000001e112

   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 100.0%

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

   4. Taylor expanded in a around 0 77.3%

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

   if -1.4000000000000001e112 < x

   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 0 76.6%

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

   4. Taylor expanded in x around 0 62.3%

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

Alternative 13: 77.7% 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.1%

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

4. Final simplification 80.1%

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

Alternative 14: 28.3% accurate, 19.1× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= 5800000.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 <= 5800000.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 <= 5800000.0) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= 5800000.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 <= 5800000.0)
		tmp = x;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 5.8e6

   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 23.9%

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

   if 5.8e6 < 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. 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 y around inf 37.5%

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

Alternative 15: 22.6% 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.1%

   \[\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 2024096 
(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)))