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

Percentage Accurate: 99.9% → 99.9%

Time: 6.6s

Alternatives: 7

Speedup: 1.0×

• 29.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\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, 0.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. fma-define 100.0%

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

   2. fma-define 100.0%

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

3. Simplified 100.0%

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

Alternative 2: 82.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.85 \cdot 10^{-96} \lor \neg \left(x \leq 2 \cdot 10^{-63}\right):\\ \;\;\;\;t + x \cdot \left(y \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t + y \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= x -1.85e-96) (not (<= x 2e-63)))
   (+ t (* x (* y y)))
   (+ t (* y z))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -1.85e-96) || !(x <= 2e-63)) {
		tmp = t + (x * (y * y));
	} else {
		tmp = t + (y * z);
	}
	return tmp;
}

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
    real(8) :: tmp
    if ((x <= (-1.85d-96)) .or. (.not. (x <= 2d-63))) then
        tmp = t + (x * (y * y))
    else
        tmp = t + (y * z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -1.85e-96) || !(x <= 2e-63)) {
		tmp = t + (x * (y * y));
	} else {
		tmp = t + (y * z);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x <= -1.85e-96) or not (x <= 2e-63):
		tmp = t + (x * (y * y))
	else:
		tmp = t + (y * z)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((x <= -1.85e-96) || !(x <= 2e-63))
		tmp = Float64(t + Float64(x * Float64(y * y)));
	else
		tmp = Float64(t + Float64(y * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x <= -1.85e-96) || ~((x <= 2e-63)))
		tmp = t + (x * (y * y));
	else
		tmp = t + (y * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[x, -1.85e-96], N[Not[LessEqual[x, 2e-63]], $MachinePrecision]], N[(t + N[(x * N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t + N[(y * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.84999999999999993e-96 or 2.00000000000000013e-63 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 93.7%

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

      1. +-commutative 93.7%

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

      2. unpow2 93.7%

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

      3. associate-/l* 96.8%

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

      4. distribute-lft-out 98.1%

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

   5. Simplified 98.1%

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

   6. Taylor expanded in y around inf 87.0%

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

   if -1.84999999999999993e-96 < x < 2.00000000000000013e-63

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 86.7%

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

4. Final simplification 86.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.85 \cdot 10^{-96} \lor \neg \left(x \leq 2 \cdot 10^{-63}\right):\\ \;\;\;\;t + x \cdot \left(y \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t + y \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 87.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.65 \cdot 10^{+57}:\\ \;\;\;\;t + y \cdot z\\ \mathbf{elif}\;z \leq 1.06 \cdot 10^{+146}:\\ \;\;\;\;t + y \cdot \left(x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(y + \frac{t}{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -2.65e+57)
   (+ t (* y z))
   (if (<= z 1.06e+146) (+ t (* y (* x y))) (* z (+ y (/ t z))))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.65e+57) {
		tmp = t + (y * z);
	} else if (z <= 1.06e+146) {
		tmp = t + (y * (x * y));
	} else {
		tmp = z * (y + (t / z));
	}
	return tmp;
}

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
    real(8) :: tmp
    if (z <= (-2.65d+57)) then
        tmp = t + (y * z)
    else if (z <= 1.06d+146) then
        tmp = t + (y * (x * y))
    else
        tmp = z * (y + (t / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.65e+57) {
		tmp = t + (y * z);
	} else if (z <= 1.06e+146) {
		tmp = t + (y * (x * y));
	} else {
		tmp = z * (y + (t / z));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -2.65e+57:
		tmp = t + (y * z)
	elif z <= 1.06e+146:
		tmp = t + (y * (x * y))
	else:
		tmp = z * (y + (t / z))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -2.65e+57)
		tmp = Float64(t + Float64(y * z));
	elseif (z <= 1.06e+146)
		tmp = Float64(t + Float64(y * Float64(x * y)));
	else
		tmp = Float64(z * Float64(y + Float64(t / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -2.65e+57)
		tmp = t + (y * z);
	elseif (z <= 1.06e+146)
		tmp = t + (y * (x * y));
	else
		tmp = z * (y + (t / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -2.65e+57], N[(t + N[(y * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.06e+146], N[(t + N[(y * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(y + N[(t / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -2.64999999999999993e57

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 86.4%

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

   if -2.64999999999999993e57 < z < 1.06000000000000005e146

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 89.7%

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

      1. *-commutative 89.7%

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

   5. Simplified 89.7%

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

   if 1.06000000000000005e146 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 96.9%

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

   4. Taylor expanded in z around inf 96.9%

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

4. Final simplification 90.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.65 \cdot 10^{+57}:\\ \;\;\;\;t + y \cdot z\\ \mathbf{elif}\;z \leq 1.06 \cdot 10^{+146}:\\ \;\;\;\;t + y \cdot \left(x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(y + \frac{t}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 47.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -42000000000:\\ \;\;\;\;t\\ \mathbf{elif}\;t \leq 2.7 \cdot 10^{-113}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -42000000000.0) t (if (<= t 2.7e-113) (* y z) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -42000000000.0) {
		tmp = t;
	} else if (t <= 2.7e-113) {
		tmp = y * z;
	} else {
		tmp = t;
	}
	return tmp;
}

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
    real(8) :: tmp
    if (t <= (-42000000000.0d0)) then
        tmp = t
    else if (t <= 2.7d-113) then
        tmp = y * z
    else
        tmp = t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -42000000000.0) {
		tmp = t;
	} else if (t <= 2.7e-113) {
		tmp = y * z;
	} else {
		tmp = t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -42000000000.0:
		tmp = t
	elif t <= 2.7e-113:
		tmp = y * z
	else:
		tmp = t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -42000000000.0)
		tmp = t;
	elseif (t <= 2.7e-113)
		tmp = Float64(y * z);
	else
		tmp = t;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -42000000000.0)
		tmp = t;
	elseif (t <= 2.7e-113)
		tmp = y * z;
	else
		tmp = t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -42000000000.0], t, If[LessEqual[t, 2.7e-113], N[(y * z), $MachinePrecision], t]]

Derivation

1. Split input into 2 regimes

2. if t < -4.2e10 or 2.69999999999999996e-113 < t

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 54.1%

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

   if -4.2e10 < t < 2.69999999999999996e-113

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 47.6%

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

   4. Taylor expanded in z around inf 47.6%

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

   5. Taylor expanded in y around inf 38.5%

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

4. Final simplification 47.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -42000000000:\\ \;\;\;\;t\\ \mathbf{elif}\;t \leq 2.7 \cdot 10^{-113}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(t + N[(y * N[(z + N[(x * y), $MachinePrecision]), $MachinePrecision]), $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 + y \cdot \left(z + x \cdot y\right) \]
4. Add Preprocessing

Alternative 6: 66.2% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

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 + (y * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in x around 0 61.5%

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

4. Final simplification 61.5%

   \[\leadsto t + y \cdot z \]
5. Add Preprocessing

Alternative 7: 38.3% accurate, 9.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := t

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

   \[\leadsto \color{blue}{t} \]
4. Add Preprocessing

Reproduce

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