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

Percentage Accurate: 100.0% → 100.0%

Time: 3.2s

Alternatives: 5

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{x}{2}, y, -0.125 \cdot z\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_] := N[(N[(x / 2.0), $MachinePrecision] * y + 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. associate-*l/ 100.0%

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

   2. fma-neg 100.0%

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

   3. distribute-frac-neg 100.0%

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

   4. neg-mul-1 100.0%

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

   5. associate-/l* 99.8%

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

   6. associate-/r/ 100.0%

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

   7. metadata-eval 100.0%

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

3. Simplified 100.0%

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

5. Final simplification 100.0%

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

Alternative 2: 78.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -2.7 \cdot 10^{-53} \lor \neg \left(x \cdot y \leq 1.4 \cdot 10^{+15}\right):\\ \;\;\;\;\left(x \cdot y\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;-0.125 \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= (* x y) -2.7e-53) (not (<= (* x y) 1.4e+15)))
   (* (* x y) 0.5)
   (* -0.125 z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (((x * y) <= -2.7e-53) || !((x * y) <= 1.4e+15)) {
		tmp = (x * y) * 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 * y) <= (-2.7d-53)) .or. (.not. ((x * y) <= 1.4d+15))) then
        tmp = (x * y) * 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 * y) <= -2.7e-53) || !((x * y) <= 1.4e+15)) {
		tmp = (x * y) * 0.5;
	} else {
		tmp = -0.125 * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if ((x * y) <= -2.7e-53) or not ((x * y) <= 1.4e+15):
		tmp = (x * y) * 0.5
	else:
		tmp = -0.125 * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((Float64(x * y) <= -2.7e-53) || !(Float64(x * y) <= 1.4e+15))
		tmp = Float64(Float64(x * y) * 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 * y) <= -2.7e-53) || ~(((x * y) <= 1.4e+15)))
		tmp = (x * y) * 0.5;
	else
		tmp = -0.125 * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[N[(x * y), $MachinePrecision], -2.7e-53], N[Not[LessEqual[N[(x * y), $MachinePrecision], 1.4e+15]], $MachinePrecision]], N[(N[(x * y), $MachinePrecision] * 0.5), $MachinePrecision], N[(-0.125 * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -2.6999999999999999e-53 or 1.4e15 < (*.f64 x y)

   1. Initial program 100.0%

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

      1. associate-/l* 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\frac{x}{\frac{2}{y}} - \frac{z}{8}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. frac-2neg 100.0%

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

      3. clear-num 99.9%

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

      4. frac-sub 87.1%

         \[\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}}} \]

      5. metadata-eval 87.1%

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

      6. metadata-eval 87.1%

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

      7. metadata-eval 87.1%

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

      8. fma-neg 87.1%

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

      9. *-commutative 87.1%

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

      10. distribute-rgt-neg-in 87.1%

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

      11. metadata-eval 87.1%

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

      12. metadata-eval 87.1%

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

      13. metadata-eval 87.1%

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

   6. Applied egg-rr 87.1%

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

      1. fma-udef 87.1%

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

      2. +-commutative 87.1%

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

      3. associate-*r/ 86.9%

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

      4. associate-*l* 86.9%

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

      5. distribute-lft-neg-out 86.9%

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

      6. distribute-rgt-neg-in 86.9%

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

      7. metadata-eval 86.9%

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

      8. associate-*l* 86.9%

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

      9. *-commutative 86.9%

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

      10. associate-*l* 86.9%

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

      11. associate-*r/ 86.9%

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

      12. metadata-eval 86.9%

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

   8. Simplified 86.9%

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

   9. Taylor expanded in x around inf 79.5%

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

       1. *-commutative 79.5%

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

   11. Simplified 79.5%

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

   if -2.6999999999999999e-53 < (*.f64 x y) < 1.4e15

   1. Initial program 100.0%

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

      1. associate-/l* 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\frac{x}{\frac{2}{y}} - \frac{z}{8}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 77.1%

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

4. Final simplification 78.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -2.7 \cdot 10^{-53} \lor \neg \left(x \cdot y \leq 1.4 \cdot 10^{+15}\right):\\ \;\;\;\;\left(x \cdot y\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;-0.125 \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (x / (2.0 / y)) - (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 / (2.0d0 / y)) - (z / 8.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. associate-/l* 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{\frac{x}{\frac{2}{y}} - \frac{z}{8}} \]
4. Add Preprocessing

5. Final simplification 99.8%

   \[\leadsto \frac{x}{\frac{2}{y}} - \frac{z}{8} \]
6. Add Preprocessing

Alternative 4: 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]

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

   \[\leadsto \frac{x \cdot y}{2} - \frac{z}{8} \]
4. Add Preprocessing

Alternative 5: 51.2% 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. Step-by-step derivation

   1. associate-/l* 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{\frac{x}{\frac{2}{y}} - \frac{z}{8}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 50.0%

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

6. Final simplification 50.0%

   \[\leadsto -0.125 \cdot z \]
7. Add Preprocessing

Reproduce

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