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

Percentage Accurate: 99.8% → 99.8%

Time: 5.7s

Alternatives: 8

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, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ y \cdot \left(x \cdot 3\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 (- (* y (* x 3.0)) z))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Final simplification 99.8%

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

Alternative 2: 72.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -1.65 \cdot 10^{+93} \lor \neg \left(x \leq 2.55 \cdot 10^{-86}\right):\\ \;\;\;\;x \cdot \left(3 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \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 (<= x -1.65e+93) (not (<= x 2.55e-86))) (* x (* 3.0 y)) (- z)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.65e+93) || !(x <= 2.55e-86)) {
		tmp = x * (3.0 * y);
	} else {
		tmp = -z;
	}
	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 ((x <= (-1.65d+93)) .or. (.not. (x <= 2.55d-86))) then
        tmp = x * (3.0d0 * y)
    else
        tmp = -z
    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 ((x <= -1.65e+93) || !(x <= 2.55e-86)) {
		tmp = x * (3.0 * y);
	} else {
		tmp = -z;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (x <= -1.65e+93) or not (x <= 2.55e-86):
		tmp = x * (3.0 * y)
	else:
		tmp = -z
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.65e+93) || !(x <= 2.55e-86))
		tmp = Float64(x * Float64(3.0 * y));
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.65e+93) || ~((x <= 2.55e-86)))
		tmp = x * (3.0 * y);
	else
		tmp = -z;
	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[x, -1.65e+93], N[Not[LessEqual[x, 2.55e-86]], $MachinePrecision]], N[(x * N[(3.0 * y), $MachinePrecision]), $MachinePrecision], (-z)]

Derivation

1. Split input into 2 regimes

2. if x < -1.65000000000000004e93 or 2.55000000000000003e-86 < x

   1. Initial program 99.8%

      \[\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 z around inf 87.9%

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

   6. Taylor expanded in z around 0 63.2%

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

      1. *-commutative 63.2%

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

      2. associate-*l* 63.3%

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

      3. *-commutative 63.3%

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

   8. Simplified 63.3%

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

   if -1.65000000000000004e93 < x < 2.55000000000000003e-86

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

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

      1. mul-1-neg 73.9%

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

   7. Simplified 73.9%

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

4. Final simplification 69.0%

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

Alternative 3: 72.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -5.8 \cdot 10^{+92} \lor \neg \left(x \leq 8 \cdot 10^{-87}\right):\\ \;\;\;\;3 \cdot \left(x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \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 (<= x -5.8e+92) (not (<= x 8e-87))) (* 3.0 (* x y)) (- z)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.8e+92) || !(x <= 8e-87)) {
		tmp = 3.0 * (x * y);
	} else {
		tmp = -z;
	}
	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 ((x <= (-5.8d+92)) .or. (.not. (x <= 8d-87))) then
        tmp = 3.0d0 * (x * y)
    else
        tmp = -z
    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 ((x <= -5.8e+92) || !(x <= 8e-87)) {
		tmp = 3.0 * (x * y);
	} else {
		tmp = -z;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (x <= -5.8e+92) or not (x <= 8e-87):
		tmp = 3.0 * (x * y)
	else:
		tmp = -z
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if ((x <= -5.8e+92) || !(x <= 8e-87))
		tmp = Float64(3.0 * Float64(x * y));
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -5.8e+92) || ~((x <= 8e-87)))
		tmp = 3.0 * (x * y);
	else
		tmp = -z;
	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[x, -5.8e+92], N[Not[LessEqual[x, 8e-87]], $MachinePrecision]], N[(3.0 * N[(x * y), $MachinePrecision]), $MachinePrecision], (-z)]

Derivation

1. Split input into 2 regimes

2. if x < -5.8000000000000001e92 or 8.00000000000000014e-87 < x

   1. Initial program 99.8%

      \[\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 z around inf 87.9%

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

   6. Taylor expanded in z around 0 63.2%

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

   if -5.8000000000000001e92 < x < 8.00000000000000014e-87

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

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

      1. mul-1-neg 73.9%

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

   7. Simplified 73.9%

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

4. Final simplification 69.0%

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

Alternative 4: 72.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -2.4 \cdot 10^{+93}:\\ \;\;\;\;y \cdot \left(x \cdot 3\right)\\ \mathbf{elif}\;x \leq 2.55 \cdot 10^{-86}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(3 \cdot y\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 (<= x -2.4e+93)
   (* y (* x 3.0))
   (if (<= x 2.55e-86) (- z) (* x (* 3.0 y)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.4e+93) {
		tmp = y * (x * 3.0);
	} else if (x <= 2.55e-86) {
		tmp = -z;
	} else {
		tmp = x * (3.0 * y);
	}
	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 (x <= (-2.4d+93)) then
        tmp = y * (x * 3.0d0)
    else if (x <= 2.55d-86) then
        tmp = -z
    else
        tmp = x * (3.0d0 * y)
    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 (x <= -2.4e+93) {
		tmp = y * (x * 3.0);
	} else if (x <= 2.55e-86) {
		tmp = -z;
	} else {
		tmp = x * (3.0 * y);
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if x <= -2.4e+93:
		tmp = y * (x * 3.0)
	elif x <= 2.55e-86:
		tmp = -z
	else:
		tmp = x * (3.0 * y)
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (x <= -2.4e+93)
		tmp = Float64(y * Float64(x * 3.0));
	elseif (x <= 2.55e-86)
		tmp = Float64(-z);
	else
		tmp = Float64(x * Float64(3.0 * y));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -2.4e+93)
		tmp = y * (x * 3.0);
	elseif (x <= 2.55e-86)
		tmp = -z;
	else
		tmp = x * (3.0 * y);
	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[LessEqual[x, -2.4e+93], N[(y * N[(x * 3.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.55e-86], (-z), N[(x * N[(3.0 * y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.4000000000000001e93

   1. Initial program 99.8%

      \[\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 z around inf 90.8%

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

   6. Taylor expanded in z around 0 71.3%

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

      1. associate-*r* 71.3%

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

      2. *-commutative 71.3%

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

   8. Simplified 71.3%

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

   if -2.4000000000000001e93 < x < 2.55000000000000003e-86

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

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

      1. mul-1-neg 73.9%

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

   7. Simplified 73.9%

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

   if 2.55000000000000003e-86 < x

   1. Initial program 99.7%

      \[\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 z around inf 86.2%

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

   6. Taylor expanded in z around 0 58.8%

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

      1. *-commutative 58.8%

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

      2. associate-*l* 58.9%

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

      3. *-commutative 58.9%

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

   8. Simplified 58.9%

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

4. Final simplification 69.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.4 \cdot 10^{+93}:\\ \;\;\;\;y \cdot \left(x \cdot 3\right)\\ \mathbf{elif}\;x \leq 2.55 \cdot 10^{-86}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(3 \cdot y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ x \cdot \left(3 \cdot y\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 (- (* x (* 3.0 y)) z))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[\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. Add Preprocessing

Alternative 6: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ 3 \cdot \left(x \cdot y\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 (* x y)) z))

C

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

Java

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

Python

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

Julia

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

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = (3.0 * (x * y)) - 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[(x * y), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\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 99.8%

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

Alternative 7: 50.9% 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.8%

   \[\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 56.8%

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

   1. mul-1-neg 56.8%

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

7. Simplified 56.8%

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

Alternative 8: 2.3% accurate, 7.0× 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 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.8%

   \[\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 56.8%

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

   1. mul-1-neg 56.8%

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

7. Simplified 56.8%

   \[\leadsto \color{blue}{-z} \]
8. Step-by-step derivation

   1. neg-sub0 56.8%

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

   2. sub-neg 56.8%

      \[\leadsto \color{blue}{0 + \left(-z\right)} \]

   3. add-sqr-sqrt 22.1%

      \[\leadsto 0 + \color{blue}{\sqrt{-z} \cdot \sqrt{-z}} \]

   4. sqrt-unprod 13.5%

      \[\leadsto 0 + \color{blue}{\sqrt{\left(-z\right) \cdot \left(-z\right)}} \]

   5. sqr-neg 13.5%

      \[\leadsto 0 + \sqrt{\color{blue}{z \cdot z}} \]

   6. sqrt-unprod 1.2%

      \[\leadsto 0 + \color{blue}{\sqrt{z} \cdot \sqrt{z}} \]

   7. add-sqr-sqrt 2.2%

      \[\leadsto 0 + \color{blue}{z} \]

9. Applied egg-rr 2.2%

   \[\leadsto \color{blue}{0 + z} \]
10. Step-by-step derivation

    1. +-lft-identity 2.2%

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

11. Simplified 2.2%

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

Developer Target 1: 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 2024163 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, B"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* x (* 3 y)) z))

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