Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, D

Percentage Accurate: 100.0% → 100.0%

Time: 3.4s

Alternatives: 4

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot y}{2} - \frac{z}{8} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (/ (* x y) 2.0) (/ z 8.0)))

C

double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x * y) / 2.0d0) - (z / 8.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

Python

def code(x, y, z):
	return ((x * y) / 2.0) - (z / 8.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x * y) / 2.0) - Float64(z / 8.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x * y) / 2.0) - (z / 8.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(x * y), $MachinePrecision] / 2.0), $MachinePrecision] - N[(z / 8.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot y}{2} - \frac{z}{8} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (/ (* x y) 2.0) (/ z 8.0)))

C

double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x * y) / 2.0d0) - (z / 8.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

Python

def code(x, y, z):
	return ((x * y) / 2.0) - (z / 8.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x * y) / 2.0) - Float64(z / 8.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x * y) / 2.0) - (z / 8.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(x * y), $MachinePrecision] / 2.0), $MachinePrecision] - N[(z / 8.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\frac{y}{2}, x, -0.125 \cdot z\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma (/ y 2.0) x (* -0.125 z)))

C

double code(double x, double y, double z) {
	return fma((y / 2.0), x, (-0.125 * z));
}

Julia

function code(x, y, z)
	return fma(Float64(y / 2.0), x, Float64(-0.125 * z))
end

Wolfram

code[x_, y_, z_] := N[(N[(y / 2.0), $MachinePrecision] * x + N[(-0.125 * z), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{x \cdot y}{2} - \frac{z}{8} \]
2. Step-by-step derivation

   1. *-commutative 100.0%

      \[\leadsto \frac{\color{blue}{y \cdot x}}{2} - \frac{z}{8} \]

   2. associate-*l/ 100.0%

      \[\leadsto \color{blue}{\frac{y}{2} \cdot x} - \frac{z}{8} \]

   3. fma-neg 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{y}{2}, x, -\frac{z}{8}\right)} \]

   4. distribute-frac-neg 100.0%

      \[\leadsto \mathsf{fma}\left(\frac{y}{2}, x, \color{blue}{\frac{-z}{8}}\right) \]

   5. neg-mul-1 100.0%

      \[\leadsto \mathsf{fma}\left(\frac{y}{2}, x, \frac{\color{blue}{-1 \cdot z}}{8}\right) \]

   6. associate-/l* 99.9%

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

   7. associate-/r/ 100.0%

      \[\leadsto \mathsf{fma}\left(\frac{y}{2}, x, \color{blue}{\frac{-1}{8} \cdot z}\right) \]

   8. metadata-eval 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(\frac{y}{2}, x, -0.125 \cdot z\right) \]

Alternative 2: 69.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{+66} \lor \neg \left(x \leq 8.2 \cdot 10^{-84}\right):\\ \;\;\;\;y \cdot \left(x \cdot 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;-0.125 \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2e+66) (not (<= x 8.2e-84))) (* y (* x 0.5)) (* -0.125 z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2e+66) || !(x <= 8.2e-84)) {
		tmp = y * (x * 0.5);
	} else {
		tmp = -0.125 * z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-2d+66)) .or. (.not. (x <= 8.2d-84))) then
        tmp = y * (x * 0.5d0)
    else
        tmp = (-0.125d0) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2e+66) || !(x <= 8.2e-84)) {
		tmp = y * (x * 0.5);
	} else {
		tmp = -0.125 * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2e+66) or not (x <= 8.2e-84):
		tmp = y * (x * 0.5)
	else:
		tmp = -0.125 * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2e+66) || !(x <= 8.2e-84))
		tmp = Float64(y * Float64(x * 0.5));
	else
		tmp = Float64(-0.125 * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2e+66) || ~((x <= 8.2e-84)))
		tmp = y * (x * 0.5);
	else
		tmp = -0.125 * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2e+66], N[Not[LessEqual[x, 8.2e-84]], $MachinePrecision]], N[(y * N[(x * 0.5), $MachinePrecision]), $MachinePrecision], N[(-0.125 * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.99999999999999989e66 or 8.2000000000000001e-84 < x

   1. Initial program 100.0%

      \[\frac{x \cdot y}{2} - \frac{z}{8} \]
   2. Step-by-step derivation

      1. frac-2neg 100.0%

         \[\leadsto \color{blue}{\frac{-x \cdot y}{-2}} - \frac{z}{8} \]

      2. clear-num 99.9%

         \[\leadsto \frac{-x \cdot y}{-2} - \color{blue}{\frac{1}{\frac{8}{z}}} \]

      3. frac-sub 88.3%

         \[\leadsto \color{blue}{\frac{\left(-x \cdot y\right) \cdot \frac{8}{z} - \left(-2\right) \cdot 1}{\left(-2\right) \cdot \frac{8}{z}}} \]

      4. metadata-eval 88.3%

         \[\leadsto \frac{\left(-x \cdot y\right) \cdot \frac{8}{z} - \color{blue}{-2} \cdot 1}{\left(-2\right) \cdot \frac{8}{z}} \]

      5. metadata-eval 88.3%

         \[\leadsto \frac{\left(-x \cdot y\right) \cdot \frac{8}{z} - \color{blue}{-2}}{\left(-2\right) \cdot \frac{8}{z}} \]

      6. metadata-eval 88.3%

         \[\leadsto \frac{\left(-x \cdot y\right) \cdot \frac{8}{z} - \color{blue}{\left(-2\right)}}{\left(-2\right) \cdot \frac{8}{z}} \]

      7. fma-neg 88.3%

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

      8. distribute-rgt-neg-in 88.3%

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

      9. metadata-eval 88.3%

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

      10. metadata-eval 88.3%

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

      11. metadata-eval 88.3%

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

   3. Applied egg-rr 88.3%

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

      1. fma-udef 88.3%

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

      2. +-commutative 88.3%

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

      3. distribute-rgt-neg-out 88.3%

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

      4. distribute-lft-neg-out 88.3%

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

      5. unsub-neg 88.3%

         \[\leadsto \frac{\color{blue}{2 - \left(x \cdot y\right) \cdot \frac{8}{z}}}{-2 \cdot \frac{8}{z}} \]

      6. *-commutative 88.3%

         \[\leadsto \frac{2 - \color{blue}{\left(y \cdot x\right)} \cdot \frac{8}{z}}{-2 \cdot \frac{8}{z}} \]

      7. associate-*l* 84.1%

         \[\leadsto \frac{2 - \color{blue}{y \cdot \left(x \cdot \frac{8}{z}\right)}}{-2 \cdot \frac{8}{z}} \]

      8. associate-*r/ 84.1%

         \[\leadsto \frac{2 - y \cdot \left(x \cdot \frac{8}{z}\right)}{\color{blue}{\frac{-2 \cdot 8}{z}}} \]

      9. metadata-eval 84.1%

         \[\leadsto \frac{2 - y \cdot \left(x \cdot \frac{8}{z}\right)}{\frac{\color{blue}{-16}}{z}} \]

   5. Simplified 84.1%

      \[\leadsto \color{blue}{\frac{2 - y \cdot \left(x \cdot \frac{8}{z}\right)}{\frac{-16}{z}}} \]

   6. Taylor expanded in y around inf 67.1%

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

      1. *-commutative 67.1%

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

      2. associate-*l* 67.1%

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

   8. Simplified 67.1%

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

   if -1.99999999999999989e66 < x < 8.2000000000000001e-84

   1. Initial program 100.0%

      \[\frac{x \cdot y}{2} - \frac{z}{8} \]

   2. Taylor expanded in x around 0 73.8%

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

4. Final simplification 70.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{+66} \lor \neg \left(x \leq 8.2 \cdot 10^{-84}\right):\\ \;\;\;\;y \cdot \left(x \cdot 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;-0.125 \cdot z\\ \end{array} \]

Alternative 3: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{y \cdot x}{2} - \frac{z}{8} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (/ (* y x) 2.0) (/ z 8.0)))

C

double code(double x, double y, double z) {
	return ((y * x) / 2.0) - (z / 8.0);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((y * x) / 2.0d0) - (z / 8.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return ((y * x) / 2.0) - (z / 8.0);
}

Python

def code(x, y, z):
	return ((y * x) / 2.0) - (z / 8.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(y * x) / 2.0) - Float64(z / 8.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((y * x) / 2.0) - (z / 8.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(y * x), $MachinePrecision] / 2.0), $MachinePrecision] - N[(z / 8.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{x \cdot y}{2} - \frac{z}{8} \]

2. Final simplification 100.0%

   \[\leadsto \frac{y \cdot x}{2} - \frac{z}{8} \]

Alternative 4: 50.4% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ -0.125 \cdot z \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* -0.125 z))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return -0.125 * z

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x \cdot y}{2} - \frac{z}{8} \]

2. Taylor expanded in x around 0 52.5%

   \[\leadsto \color{blue}{-0.125 \cdot z} \]

3. Final simplification 52.5%

   \[\leadsto -0.125 \cdot z \]

Reproduce

herbie shell --seed 2023268 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, D"
  :precision binary64
  (- (/ (* x y) 2.0) (/ z 8.0)))