Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, B

Percentage Accurate: 99.8% → 99.8%

Time: 5.3s

Alternatives: 6

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \mathsf{fma}\left(3 \cdot y, x, -z\right) \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (fma (* 3.0 y) x (- z)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return fma((3.0 * y), x, -z);
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return fma(Float64(3.0 * y), x, Float64(-z))
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(N[(3.0 * y), $MachinePrecision] * x + (-z)), $MachinePrecision]

Derivation

1. Initial program 99.9%

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

   1. associate-*l* 99.8%

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

   2. *-commutative 99.8%

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

   3. fma-neg 99.9%

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

3. Simplified 99.9%

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

Alternative 2: 69.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -2.2 \cdot 10^{+35} \lor \neg \left(z \leq 5.2 \cdot 10^{-73}\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;\left(3 \cdot y\right) \cdot x\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (or (<= z -2.2e+35) (not (<= z 5.2e-73))) (- z) (* (* 3.0 y) x)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((z <= -2.2e+35) || !(z <= 5.2e-73)) {
		tmp = -z;
	} else {
		tmp = (3.0 * y) * x;
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 ((z <= (-2.2d+35)) .or. (.not. (z <= 5.2d-73))) then
        tmp = -z
    else
        tmp = (3.0d0 * y) * x
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -2.2e+35) || !(z <= 5.2e-73)) {
		tmp = -z;
	} else {
		tmp = (3.0 * y) * x;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (z <= -2.2e+35) or not (z <= 5.2e-73):
		tmp = -z
	else:
		tmp = (3.0 * y) * x
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if ((z <= -2.2e+35) || !(z <= 5.2e-73))
		tmp = Float64(-z);
	else
		tmp = Float64(Float64(3.0 * y) * x);
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -2.2e+35) || ~((z <= 5.2e-73)))
		tmp = -z;
	else
		tmp = (3.0 * y) * x;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[Or[LessEqual[z, -2.2e+35], N[Not[LessEqual[z, 5.2e-73]], $MachinePrecision]], (-z), N[(N[(3.0 * y), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.1999999999999999e35 or 5.2000000000000002e-73 < z

   1. Initial program 99.9%

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

      1. associate-*l* 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x \cdot \left(3 \cdot y\right) - z} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 77.2%

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

      1. mul-1-neg 77.2%

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

   7. Simplified 77.2%

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

   if -2.1999999999999999e35 < z < 5.2000000000000002e-73

   1. Initial program 99.8%

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

      1. associate-*l* 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{x \cdot \left(3 \cdot y\right) - z} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 98.0%

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

      1. +-commutative 98.0%

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

      2. mul-1-neg 98.0%

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

      3. unsub-neg 98.0%

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

   7. Simplified 98.0%

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

   8. Taylor expanded in x around inf 73.7%

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

      1. associate-*r* 73.8%

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

      2. *-commutative 73.8%

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

      3. associate-*r* 73.7%

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

   10. Simplified 73.7%

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

4. Final simplification 75.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.2 \cdot 10^{+35} \lor \neg \left(z \leq 5.2 \cdot 10^{-73}\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;\left(3 \cdot y\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 70.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -4.8 \cdot 10^{+29} \lor \neg \left(z \leq 6.6 \cdot 10^{-73}\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;3 \cdot \left(y \cdot x\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (or (<= z -4.8e+29) (not (<= z 6.6e-73))) (- z) (* 3.0 (* y x))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((z <= -4.8e+29) || !(z <= 6.6e-73)) {
		tmp = -z;
	} else {
		tmp = 3.0 * (y * x);
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 ((z <= (-4.8d+29)) .or. (.not. (z <= 6.6d-73))) then
        tmp = -z
    else
        tmp = 3.0d0 * (y * x)
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -4.8e+29) || !(z <= 6.6e-73)) {
		tmp = -z;
	} else {
		tmp = 3.0 * (y * x);
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (z <= -4.8e+29) or not (z <= 6.6e-73):
		tmp = -z
	else:
		tmp = 3.0 * (y * x)
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if ((z <= -4.8e+29) || !(z <= 6.6e-73))
		tmp = Float64(-z);
	else
		tmp = Float64(3.0 * Float64(y * x));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -4.8e+29) || ~((z <= 6.6e-73)))
		tmp = -z;
	else
		tmp = 3.0 * (y * x);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[Or[LessEqual[z, -4.8e+29], N[Not[LessEqual[z, 6.6e-73]], $MachinePrecision]], (-z), N[(3.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -4.8000000000000002e29 or 6.60000000000000007e-73 < z

   1. Initial program 99.9%

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

      1. associate-*l* 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x \cdot \left(3 \cdot y\right) - z} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 76.8%

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

      1. mul-1-neg 76.8%

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

   7. Simplified 76.8%

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

   if -4.8000000000000002e29 < z < 6.60000000000000007e-73

   1. Initial program 99.8%

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

      1. associate-*l* 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{x \cdot \left(3 \cdot y\right) - z} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 98.8%

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

      1. +-commutative 98.8%

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

      2. mul-1-neg 98.8%

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

      3. unsub-neg 98.8%

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

   7. Simplified 98.8%

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

   8. Taylor expanded in x around inf 74.1%

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

4. Final simplification 75.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.8 \cdot 10^{+29} \lor \neg \left(z \leq 6.6 \cdot 10^{-73}\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;3 \cdot \left(y \cdot x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \left(3 \cdot y\right) \cdot x - z \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (- (* (* 3.0 y) x) z))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return ((3.0 * y) * x) - z;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((3.0d0 * y) * x) - z
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	return ((3.0 * y) * x) - z;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return ((3.0 * y) * x) - z

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(Float64(Float64(3.0 * y) * x) - z)
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = ((3.0 * y) * x) - z;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(N[(N[(3.0 * y), $MachinePrecision] * x), $MachinePrecision] - z), $MachinePrecision]

Derivation

1. Initial program 99.9%

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

   1. associate-*l* 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \left(3 \cdot y\right) - z} \]
4. Add Preprocessing

5. Final simplification 99.8%

   \[\leadsto \left(3 \cdot y\right) \cdot x - z \]
6. Add Preprocessing

Alternative 5: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ 3 \cdot \left(y \cdot x\right) - z \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (- (* 3.0 (* y x)) z))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return (3.0 * (y * x)) - z;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (3.0d0 * (y * x)) - z
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	return (3.0 * (y * x)) - z;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return (3.0 * (y * x)) - z

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(Float64(3.0 * Float64(y * x)) - z)
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = (3.0 * (y * x)) - z;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(N[(3.0 * N[(y * x), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]

Derivation

1. Initial program 99.9%

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

   1. associate-*l* 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \left(3 \cdot y\right) - z} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 99.8%

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

6. Final simplification 99.8%

   \[\leadsto 3 \cdot \left(y \cdot x\right) - z \]
7. Add Preprocessing

Alternative 6: 50.1% accurate, 3.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ -z \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (- z))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return -z;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = -z
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	return -z;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return -z

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(-z)
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = -z;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := (-z)

Derivation

1. Initial program 99.9%

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

   1. associate-*l* 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \left(3 \cdot y\right) - z} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 54.0%

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

   1. mul-1-neg 54.0%

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

7. Simplified 54.0%

   \[\leadsto \color{blue}{-z} \]
8. Add Preprocessing

Developer target: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024101 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, B"
  :precision binary64

  :alt
  (- (* x (* 3.0 y)) z)

  (- (* (* x 3.0) y) z))