Linear.V3:$cdot from linear-1.19.1.3, B

Percentage Accurate: 97.8% → 98.8%

Time: 5.0s

Alternatives: 7

Speedup: 1.2×

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

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((x * y) + (z * t)) + (a * 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 * t)) + (a * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((x * y) + (z * t)) + (a * 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 * t)) + (a * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.8% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.4%

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

   1. lift-+.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. +-commutative N/A

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

   4. associate-+l+ N/A

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

   5. lift-*.f64 N/A

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

   6. lower-fma.f64 N/A

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

   7. +-commutative N/A

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

   8. lift-*.f64 N/A

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

   9. *-commutative N/A

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

   10. lower-fma.f64 99.2

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

   11. lift-*.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 99.2

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

4. Applied rewrites 99.2%

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

5. Final simplification 99.2%

   \[\leadsto \mathsf{fma}\left(z, t, \mathsf{fma}\left(b, a, x \cdot y\right)\right) \]
6. Add Preprocessing

Alternative 2: 53.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+36}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \cdot y \leq -1 \cdot 10^{-188}:\\ \;\;\;\;a \cdot b\\ \mathbf{elif}\;x \cdot y \leq 200000000000:\\ \;\;\;\;t \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= (* x y) -5e+36)
   (* x y)
   (if (<= (* x y) -1e-188)
     (* a b)
     (if (<= (* x y) 200000000000.0) (* t z) (* x y)))))

C

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

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (x * y) <= -5e+36:
		tmp = x * y
	elif (x * y) <= -1e-188:
		tmp = a * b
	elif (x * y) <= 200000000000.0:
		tmp = t * z
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(x * y) <= -5e+36)
		tmp = Float64(x * y);
	elseif (Float64(x * y) <= -1e-188)
		tmp = Float64(a * b);
	elseif (Float64(x * y) <= 200000000000.0)
		tmp = Float64(t * z);
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((x * y) <= -5e+36)
		tmp = x * y;
	elseif ((x * y) <= -1e-188)
		tmp = a * b;
	elseif ((x * y) <= 200000000000.0)
		tmp = t * z;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(x * y), $MachinePrecision], -5e+36], N[(x * y), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -1e-188], N[(a * b), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 200000000000.0], N[(t * z), $MachinePrecision], N[(x * y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x y) < -4.99999999999999977e36 or 2e11 < (*.f64 x y)

   1. Initial program 96.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 62.4

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

   5. Applied rewrites 62.4%

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

   if -4.99999999999999977e36 < (*.f64 x y) < -9.9999999999999995e-189

   1. Initial program 99.1%

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

   3. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 44.1

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

   5. Applied rewrites 44.1%

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

   if -9.9999999999999995e-189 < (*.f64 x y) < 2e11

   1. Initial program 99.4%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{t \cdot z} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{z \cdot t} \]

      2. lower-*.f64 47.0

         \[\leadsto \color{blue}{z \cdot t} \]

   5. Applied rewrites 47.0%

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

4. Final simplification 53.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+36}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \cdot y \leq -1 \cdot 10^{-188}:\\ \;\;\;\;a \cdot b\\ \mathbf{elif}\;x \cdot y \leq 200000000000:\\ \;\;\;\;t \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024230 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  :precision binary64
  (+ (+ (* x y) (* z t)) (* a b)))