Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23

Percentage Accurate: 99.9% → 99.9%

Time: 5.9s

Alternatives: 7

Speedup: 1.0×

• 29.5% 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\right) \cdot y + t \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Final simplification 99.9%

   \[\leadsto t + \left(z + y \cdot x\right) \cdot y \]
4. Add Preprocessing

Alternative 2: 91.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(z + y \cdot x\right) \cdot y\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+75}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+116}:\\ \;\;\;\;\mathsf{fma}\left(z, y, t\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y, z\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ z (* y x)) y)))
   (if (<= t_1 -2e+75)
     t_1
     (if (<= t_1 2e+116) (fma z y t) (* (fma x y z) y)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z + (y * x)) * y;
	double tmp;
	if (t_1 <= -2e+75) {
		tmp = t_1;
	} else if (t_1 <= 2e+116) {
		tmp = fma(z, y, t);
	} else {
		tmp = fma(x, y, z) * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z + Float64(y * x)) * y)
	tmp = 0.0
	if (t_1 <= -2e+75)
		tmp = t_1;
	elseif (t_1 <= 2e+116)
		tmp = fma(z, y, t);
	else
		tmp = Float64(fma(x, y, z) * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z + N[(y * x), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+75], t$95$1, If[LessEqual[t$95$1, 2e+116], N[(z * y + t), $MachinePrecision], N[(N[(x * y + z), $MachinePrecision] * y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -1.99999999999999985e75

   1. Initial program 99.8%

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

   3. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 95.4

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

   5. Applied rewrites 95.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, z\right) \cdot y} \]
   6. Step-by-step derivation

   7. Applied rewrites 95.4%

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

   if -1.99999999999999985e75 < (*.f64 (+.f64 (*.f64 x y) z) y) < 2.00000000000000003e116

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 93.3

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

   5. Applied rewrites 93.3%

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

   if 2.00000000000000003e116 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 99.8%

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

   3. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 96.4

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

   5. Applied rewrites 96.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, z\right) \cdot y} \]
3. Recombined 3 regimes into one program.

4. Final simplification 94.5%

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

Alternative 3: 91.0% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ z (* y x)) y)) (t_2 (* (fma x y z) y)))
   (if (<= t_1 -2e+75) t_2 (if (<= t_1 2e+116) (fma z y t) t_2))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z + (y * x)) * y;
	double t_2 = fma(x, y, z) * y;
	double tmp;
	if (t_1 <= -2e+75) {
		tmp = t_2;
	} else if (t_1 <= 2e+116) {
		tmp = fma(z, y, t);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z + Float64(y * x)) * y)
	t_2 = Float64(fma(x, y, z) * y)
	tmp = 0.0
	if (t_1 <= -2e+75)
		tmp = t_2;
	elseif (t_1 <= 2e+116)
		tmp = fma(z, y, t);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z + N[(y * x), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * y + z), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+75], t$95$2, If[LessEqual[t$95$1, 2e+116], N[(z * y + t), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -1.99999999999999985e75 or 2.00000000000000003e116 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 99.8%

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

   3. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 95.9

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

   5. Applied rewrites 95.9%

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

   if -1.99999999999999985e75 < (*.f64 (+.f64 (*.f64 x y) z) y) < 2.00000000000000003e116

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 93.3

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

   5. Applied rewrites 93.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, t\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 94.5%

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

Alternative 4: 81.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(z + y \cdot x\right) \cdot y\\ t_2 := \left(y \cdot y\right) \cdot x\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+291}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+286}:\\ \;\;\;\;\mathsf{fma}\left(z, y, t\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ z (* y x)) y)) (t_2 (* (* y y) x)))
   (if (<= t_1 -2e+291) t_2 (if (<= t_1 5e+286) (fma z y t) t_2))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z + (y * x)) * y;
	double t_2 = (y * y) * x;
	double tmp;
	if (t_1 <= -2e+291) {
		tmp = t_2;
	} else if (t_1 <= 5e+286) {
		tmp = fma(z, y, t);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z + Float64(y * x)) * y)
	t_2 = Float64(Float64(y * y) * x)
	tmp = 0.0
	if (t_1 <= -2e+291)
		tmp = t_2;
	elseif (t_1 <= 5e+286)
		tmp = fma(z, y, t);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z + N[(y * x), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y * y), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+291], t$95$2, If[LessEqual[t$95$1, 5e+286], N[(z * y + t), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -1.9999999999999999e291 or 5.0000000000000004e286 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

         \[\leadsto \color{blue}{\left(y \cdot y\right)} \cdot x \]

      4. lower-*.f64 85.7

         \[\leadsto \color{blue}{\left(y \cdot y\right)} \cdot x \]

   5. Applied rewrites 85.7%

      \[\leadsto \color{blue}{\left(y \cdot y\right) \cdot x} \]

   if -1.9999999999999999e291 < (*.f64 (+.f64 (*.f64 x y) z) y) < 5.0000000000000004e286

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 82.2

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

   5. Applied rewrites 82.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, t\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.1%

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

Alternative 5: 80.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(z + y \cdot x\right) \cdot y\\ t_2 := \left(y \cdot x\right) \cdot y\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+291}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+286}:\\ \;\;\;\;\mathsf{fma}\left(z, y, t\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ z (* y x)) y)) (t_2 (* (* y x) y)))
   (if (<= t_1 -2e+291) t_2 (if (<= t_1 5e+286) (fma z y t) t_2))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z + (y * x)) * y;
	double t_2 = (y * x) * y;
	double tmp;
	if (t_1 <= -2e+291) {
		tmp = t_2;
	} else if (t_1 <= 5e+286) {
		tmp = fma(z, y, t);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z + Float64(y * x)) * y)
	t_2 = Float64(Float64(y * x) * y)
	tmp = 0.0
	if (t_1 <= -2e+291)
		tmp = t_2;
	elseif (t_1 <= 5e+286)
		tmp = fma(z, y, t);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z + N[(y * x), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+291], t$95$2, If[LessEqual[t$95$1, 5e+286], N[(z * y + t), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -1.9999999999999999e291 or 5.0000000000000004e286 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in z around 0

      \[\leadsto \left(x \cdot y\right) \cdot y \]
   7. Step-by-step derivation

   8. Applied rewrites 84.3%

      \[\leadsto \left(x \cdot y\right) \cdot y \]

   if -1.9999999999999999e291 < (*.f64 (+.f64 (*.f64 x y) z) y) < 5.0000000000000004e286

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 82.2

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

   5. Applied rewrites 82.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, t\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.7%

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

Alternative 6: 66.0% accurate, 2.4× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (fma z y t))

C

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

Julia

function code(x, y, z, t)
	return fma(z, y, t)
end

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 68.2

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

5. Applied rewrites 68.2%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, t\right)} \]
6. Add Preprocessing

Alternative 7: 29.9% accurate, 2.8× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (* z y))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(z * y), $MachinePrecision]

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in z around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 27.0

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

5. Applied rewrites 27.0%

   \[\leadsto \color{blue}{z \cdot y} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024244 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  :precision binary64
  (+ (* (+ (* x y) z) y) t))