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

Percentage Accurate: 99.8% → 99.8%

Time: 5.1s

Alternatives: 13

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), 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, 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), 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]

Derivation

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

Alternative 2: 87.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 5.00000000000000032e-159

   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. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

      6. lift--.f64 78.6

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

   4. Applied rewrites 78.6%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. *-commutative N/A

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

      4. associate-+r- N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. associate--l+ N/A

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

      8. *-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(b, a - \frac{1}{2}, z - z \cdot \log t\right) + x \]

      11. lift--.f64 N/A

          \[\leadsto \mathsf{fma}\left(b, a - \frac{1}{2}, z - z \cdot \log t\right) + x \]

      12. lower--.f64 N/A

          \[\leadsto \mathsf{fma}\left(b, a - \frac{1}{2}, z - z \cdot \log t\right) + x \]

      13. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(b, a - \frac{1}{2}, z - \log t \cdot z\right) + x \]

      14. lift-log.f64 N/A

          \[\leadsto \mathsf{fma}\left(b, a - \frac{1}{2}, z - \log t \cdot z\right) + x \]

      15. lift-*.f64 78.8

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

   7. Applied rewrites 78.8%

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

   if 5.00000000000000032e-159 < (+.f64 x 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. Taylor expanded in x around 0

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

      1. associate--l+ N/A

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

      2. lower-+.f64 N/A

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

      3. lower--.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift--.f64 N/A

         \[\leadsto y + \left(\mathsf{fma}\left(a - \frac{1}{2}, b, z\right) - z \cdot \log t\right) \]

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift-log.f64 78.8

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

   4. Applied rewrites 78.8%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      6. lift-log.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      7. lift--.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      9. lift--.f64 78.8

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

   7. Applied rewrites 78.8%

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

Alternative 3: 85.3% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -2e14

   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. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

      6. lift--.f64 78.6

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

   4. Applied rewrites 78.6%

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

   if -2e14 < (+.f64 x 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. Taylor expanded in x around 0

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

      1. associate--l+ N/A

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

      2. lower-+.f64 N/A

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

      3. lower--.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift--.f64 N/A

         \[\leadsto y + \left(\mathsf{fma}\left(a - \frac{1}{2}, b, z\right) - z \cdot \log t\right) \]

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift-log.f64 78.8

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

   4. Applied rewrites 78.8%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      6. lift-log.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      7. lift--.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      9. lift--.f64 78.8

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

   7. Applied rewrites 78.8%

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

Alternative 4: 85.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(a - 0.5, b, y\right) + x\\ \mathbf{if}\;b \leq -2.2 \cdot 10^{-37}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 7.8 \cdot 10^{-95}:\\ \;\;\;\;\mathsf{fma}\left(1 - \log t, z, y\right) + x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ (fma (- a 0.5) b y) x)))
   (if (<= b -2.2e-37)
     t_1
     (if (<= b 7.8e-95) (+ (fma (- 1.0 (log t)) z y) x) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma((a - 0.5), b, y) + x;
	double tmp;
	if (b <= -2.2e-37) {
		tmp = t_1;
	} else if (b <= 7.8e-95) {
		tmp = fma((1.0 - log(t)), z, y) + x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(fma(Float64(a - 0.5), b, y) + x)
	tmp = 0.0
	if (b <= -2.2e-37)
		tmp = t_1;
	elseif (b <= 7.8e-95)
		tmp = Float64(fma(Float64(1.0 - log(t)), z, y) + x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -2.20000000000000002e-37 or 7.8e-95 < b

   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. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

      6. lift--.f64 78.6

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

   4. Applied rewrites 78.6%

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

   if -2.20000000000000002e-37 < b < 7.8e-95

   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. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

      6. lift--.f64 78.6

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

   4. Applied rewrites 78.6%

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

   5. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\left(x + \left(y + z\right)\right) - z \cdot \log t} \]
   6. Step-by-step derivation

      1. associate-+l+ N/A

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

      2. lower--.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

         \[\leadsto \left(z + \left(y + x\right)\right) - z \cdot \log t \]

      6. lower-+.f64 N/A

         \[\leadsto \left(z + \left(y + x\right)\right) - z \cdot \log t \]

      7. *-commutative N/A

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

      8. lift-log.f64 N/A

         \[\leadsto \left(z + \left(y + x\right)\right) - \log t \cdot z \]

      9. lift-*.f64 63.3

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

   7. Applied rewrites 63.3%

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

   8. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) + x \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) + x \]

      7. lift-log.f64 63.3

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) + x \]

   10. Applied rewrites 63.3%

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

Alternative 5: 84.2% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -2.65e+219)
   (+ y (- z (* (log t) z)))
   (if (<= z 8e+197) (+ (fma (- a 0.5) b y) x) (fma (- 1.0 (log t)) z y))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -2.64999999999999992e219

   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. Taylor expanded in x around 0

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

      1. associate--l+ N/A

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

      2. lower-+.f64 N/A

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

      3. lower--.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift--.f64 N/A

         \[\leadsto y + \left(\mathsf{fma}\left(a - \frac{1}{2}, b, z\right) - z \cdot \log t\right) \]

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift-log.f64 78.8

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

   4. Applied rewrites 78.8%

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

   5. Taylor expanded in b around 0

      \[\leadsto y + \left(z - \color{blue}{z \cdot \log t}\right) \]
   6. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. *-commutative N/A

         \[\leadsto y + \left(z - \log t \cdot z\right) \]

      3. lift-log.f64 N/A

         \[\leadsto y + \left(z - \log t \cdot z\right) \]

      4. lift-*.f64 42.7

         \[\leadsto y + \left(z - \log t \cdot z\right) \]

   7. Applied rewrites 42.7%

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

   if -2.64999999999999992e219 < z < 7.9999999999999996e197

   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. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

      6. lift--.f64 78.6

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

   4. Applied rewrites 78.6%

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

   if 7.9999999999999996e197 < z

   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. Taylor expanded in x around 0

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

      1. associate--l+ N/A

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

      2. lower-+.f64 N/A

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

      3. lower--.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift--.f64 N/A

         \[\leadsto y + \left(\mathsf{fma}\left(a - \frac{1}{2}, b, z\right) - z \cdot \log t\right) \]

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift-log.f64 78.8

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

   4. Applied rewrites 78.8%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      6. lift-log.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      7. lift--.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      9. lift--.f64 78.8

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

   7. Applied rewrites 78.8%

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

   8. Taylor expanded in b around 0

      \[\leadsto y + z \cdot \color{blue}{\left(1 - \log t\right)} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto z \cdot \left(1 - \log t\right) + y \]

      2. *-commutative N/A

         \[\leadsto \left(1 - \log t\right) \cdot z + y \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) \]

      4. lift-log.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) \]

      5. lift--.f64 42.8

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) \]

   10. Applied rewrites 42.8%

       \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 83.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(1 - \log t, z, y\right)\\ \mathbf{if}\;z \leq -2.65 \cdot 10^{+219}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 8 \cdot 10^{+197}:\\ \;\;\;\;\mathsf{fma}\left(a - 0.5, b, y\right) + x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (fma (- 1.0 (log t)) z y)))
   (if (<= z -2.65e+219)
     t_1
     (if (<= z 8e+197) (+ (fma (- a 0.5) b y) x) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma((1.0 - log(t)), z, y);
	double tmp;
	if (z <= -2.65e+219) {
		tmp = t_1;
	} else if (z <= 8e+197) {
		tmp = fma((a - 0.5), b, y) + x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = fma(Float64(1.0 - log(t)), z, y)
	tmp = 0.0
	if (z <= -2.65e+219)
		tmp = t_1;
	elseif (z <= 8e+197)
		tmp = Float64(fma(Float64(a - 0.5), b, y) + x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.64999999999999992e219 or 7.9999999999999996e197 < z

   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. Taylor expanded in x around 0

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

      1. associate--l+ N/A

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

      2. lower-+.f64 N/A

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

      3. lower--.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift--.f64 N/A

         \[\leadsto y + \left(\mathsf{fma}\left(a - \frac{1}{2}, b, z\right) - z \cdot \log t\right) \]

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift-log.f64 78.8

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

   4. Applied rewrites 78.8%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      6. lift-log.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      7. lift--.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, b \cdot \left(a - \frac{1}{2}\right)\right) + y \]

      9. lift--.f64 78.8

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

   7. Applied rewrites 78.8%

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

   8. Taylor expanded in b around 0

      \[\leadsto y + z \cdot \color{blue}{\left(1 - \log t\right)} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto z \cdot \left(1 - \log t\right) + y \]

      2. *-commutative N/A

         \[\leadsto \left(1 - \log t\right) \cdot z + y \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) \]

      4. lift-log.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) \]

      5. lift--.f64 42.8

         \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) \]

   10. Applied rewrites 42.8%

       \[\leadsto \mathsf{fma}\left(1 - \log t, z, y\right) \]

   if -2.64999999999999992e219 < z < 7.9999999999999996e197

   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. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

      6. lift--.f64 78.6

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

   4. Applied rewrites 78.6%

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

Alternative 7: 78.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(1 - \log t\right) \cdot z\\ \mathbf{if}\;z \leq -5.8 \cdot 10^{+224}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 3.7 \cdot 10^{+200}:\\ \;\;\;\;\mathsf{fma}\left(a - 0.5, b, y\right) + x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (- 1.0 (log t)) z)))
   (if (<= z -5.8e+224)
     t_1
     (if (<= z 3.7e+200) (+ (fma (- a 0.5) b y) x) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (1.0 - log(t)) * z;
	double tmp;
	if (z <= -5.8e+224) {
		tmp = t_1;
	} else if (z <= 3.7e+200) {
		tmp = fma((a - 0.5), b, y) + x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(1.0 - log(t)) * z)
	tmp = 0.0
	if (z <= -5.8e+224)
		tmp = t_1;
	elseif (z <= 3.7e+200)
		tmp = Float64(fma(Float64(a - 0.5), b, y) + x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -5.79999999999999978e224 or 3.7000000000000001e200 < z

   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. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \left(1 - \log t\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

         \[\leadsto \left(1 - \log t\right) \cdot z \]

      4. lift-log.f64 22.6

         \[\leadsto \left(1 - \log t\right) \cdot z \]

   4. Applied rewrites 22.6%

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

   if -5.79999999999999978e224 < z < 3.7000000000000001e200

   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. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

      6. lift--.f64 78.6

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

   4. Applied rewrites 78.6%

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

Alternative 8: 78.6% accurate, 2.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

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. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 N/A

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

   3. +-commutative N/A

      \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

   4. *-commutative N/A

      \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

   5. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

   6. lift--.f64 78.6

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

4. Applied rewrites 78.6%

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

Alternative 9: 68.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (+.f64 (+.f64 x y) z) (*.f64 z (log.f64 t))) < -2e-174

   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. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

      6. lift--.f64 78.6

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

   4. Applied rewrites 78.6%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(b, a - \color{blue}{\frac{1}{2}}, x\right) \]

      3. lift--.f64 57.9

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

   7. Applied rewrites 57.9%

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

   if -2e-174 < (-.f64 (+.f64 (+.f64 x y) z) (*.f64 z (log.f64 t)))

   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. Taylor expanded in x around 0

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

      1. associate--l+ N/A

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

      2. lower-+.f64 N/A

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

      3. lower--.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift--.f64 N/A

         \[\leadsto y + \left(\mathsf{fma}\left(a - \frac{1}{2}, b, z\right) - z \cdot \log t\right) \]

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift-log.f64 78.8

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

   4. Applied rewrites 78.8%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto b \cdot \left(a - \frac{1}{2}\right) + y \]

      2. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(b, a - \color{blue}{\frac{1}{2}}, y\right) \]

      3. lift--.f64 58.0

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

   7. Applied rewrites 58.0%

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

Alternative 10: 58.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(a - 0.5\right) \cdot b\\ t_2 := \mathsf{fma}\left(b, a - 0.5, y\right)\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{-6}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+90}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (- a 0.5) b)) (t_2 (fma b (- a 0.5) y)))
   (if (<= t_1 -2e-6) t_2 (if (<= t_1 4e+90) (+ y x) t_2))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (a - 0.5) * b;
	double t_2 = fma(b, (a - 0.5), y);
	double tmp;
	if (t_1 <= -2e-6) {
		tmp = t_2;
	} else if (t_1 <= 4e+90) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(a - 0.5) * b)
	t_2 = fma(b, Float64(a - 0.5), y)
	tmp = 0.0
	if (t_1 <= -2e-6)
		tmp = t_2;
	elseif (t_1 <= 4e+90)
		tmp = Float64(y + x);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < -1.99999999999999991e-6 or 3.99999999999999987e90 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b)

   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. Taylor expanded in x around 0

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

      1. associate--l+ N/A

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

      2. lower-+.f64 N/A

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

      3. lower--.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift--.f64 N/A

         \[\leadsto y + \left(\mathsf{fma}\left(a - \frac{1}{2}, b, z\right) - z \cdot \log t\right) \]

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift-log.f64 78.8

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

   4. Applied rewrites 78.8%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto b \cdot \left(a - \frac{1}{2}\right) + y \]

      2. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(b, a - \color{blue}{\frac{1}{2}}, y\right) \]

      3. lift--.f64 58.0

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

   7. Applied rewrites 58.0%

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

   if -1.99999999999999991e-6 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < 3.99999999999999987e90

   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. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

      6. lift--.f64 78.6

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

   4. Applied rewrites 78.6%

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

   5. Taylor expanded in b around 0

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

      1. +-commutative N/A

         \[\leadsto y + x \]

      2. lower-+.f64 42.4

         \[\leadsto y + x \]

   7. Applied rewrites 42.4%

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

Alternative 11: 57.3% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (- a 0.5) b)))
   (if (<= t_1 -4e+197) (* b a) (if (<= t_1 2e+254) (+ y x) (* b a)))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (a - 0.5d0) * b
    if (t_1 <= (-4d+197)) then
        tmp = b * a
    else if (t_1 <= 2d+254) then
        tmp = y + x
    else
        tmp = b * a
    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 = (a - 0.5) * b;
	double tmp;
	if (t_1 <= -4e+197) {
		tmp = b * a;
	} else if (t_1 <= 2e+254) {
		tmp = y + x;
	} else {
		tmp = b * a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (a - 0.5) * b
	tmp = 0
	if t_1 <= -4e+197:
		tmp = b * a
	elif t_1 <= 2e+254:
		tmp = y + x
	else:
		tmp = b * a
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(a - 0.5) * b)
	tmp = 0.0
	if (t_1 <= -4e+197)
		tmp = Float64(b * a);
	elseif (t_1 <= 2e+254)
		tmp = Float64(y + x);
	else
		tmp = Float64(b * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (a - 0.5) * b;
	tmp = 0.0;
	if (t_1 <= -4e+197)
		tmp = b * a;
	elseif (t_1 <= 2e+254)
		tmp = y + x;
	else
		tmp = b * a;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < -3.9999999999999998e197 or 1.9999999999999999e254 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b)

   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. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 25.4

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

   4. Applied rewrites 25.4%

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

   if -3.9999999999999998e197 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < 1.9999999999999999e254

   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. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

      6. lift--.f64 78.6

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

   4. Applied rewrites 78.6%

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

   5. Taylor expanded in b around 0

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

      1. +-commutative N/A

         \[\leadsto y + x \]

      2. lower-+.f64 42.4

         \[\leadsto y + x \]

   7. Applied rewrites 42.4%

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

Alternative 12: 42.4% accurate, 7.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 N/A

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

   3. +-commutative N/A

      \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

   4. *-commutative N/A

      \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

   5. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

   6. lift--.f64 78.6

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

4. Applied rewrites 78.6%

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

5. Taylor expanded in b around 0

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

   1. +-commutative N/A

      \[\leadsto y + x \]

   2. lower-+.f64 42.4

      \[\leadsto y + x \]

7. Applied rewrites 42.4%

   \[\leadsto y + \color{blue}{x} \]
8. Add Preprocessing

Alternative 13: 22.2% accurate, 26.1× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 N/A

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

   3. +-commutative N/A

      \[\leadsto \left(b \cdot \left(a - \frac{1}{2}\right) + y\right) + x \]

   4. *-commutative N/A

      \[\leadsto \left(\left(a - \frac{1}{2}\right) \cdot b + y\right) + x \]

   5. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(a - \frac{1}{2}, b, y\right) + x \]

   6. lift--.f64 78.6

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

4. Applied rewrites 78.6%

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

5. Taylor expanded in b around 0

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

   1. +-commutative N/A

      \[\leadsto y + x \]

   2. lower-+.f64 42.4

      \[\leadsto y + x \]

7. Applied rewrites 42.4%

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

8. Taylor expanded in x around 0

   \[\leadsto y \]
9. Step-by-step derivation

10. Applied rewrites 22.2%

    \[\leadsto y \]
11. Add Preprocessing

Reproduce

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