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

Percentage Accurate: 99.8% → 99.8%

Time: 5.6s

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} \\ y \cdot \left(x \cdot 3\right) - z \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Final simplification 99.9%

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

Alternative 2: 71.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -28000000000000 \lor \neg \left(x \leq 2.8 \cdot 10^{-60}\right):\\ \;\;\;\;3 \cdot \left(x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -28000000000000.0) (not (<= x 2.8e-60))) (* 3.0 (* x y)) (- z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -28000000000000.0) || !(x <= 2.8e-60)) {
		tmp = 3.0 * (x * y);
	} else {
		tmp = -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 <= (-28000000000000.0d0)) .or. (.not. (x <= 2.8d-60))) then
        tmp = 3.0d0 * (x * y)
    else
        tmp = -z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -28000000000000.0) || !(x <= 2.8e-60)) {
		tmp = 3.0 * (x * y);
	} else {
		tmp = -z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -28000000000000.0) or not (x <= 2.8e-60):
		tmp = 3.0 * (x * y)
	else:
		tmp = -z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -28000000000000.0) || !(x <= 2.8e-60))
		tmp = Float64(3.0 * Float64(x * y));
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -28000000000000.0) || ~((x <= 2.8e-60)))
		tmp = 3.0 * (x * y);
	else
		tmp = -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -28000000000000.0], N[Not[LessEqual[x, 2.8e-60]], $MachinePrecision]], N[(3.0 * N[(x * y), $MachinePrecision]), $MachinePrecision], (-z)]

Derivation

1. Split input into 2 regimes

2. if x < -2.8e13 or 2.8000000000000002e-60 < x

   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 inf 99.8%

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

      1. +-commutative 99.8%

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

      2. mul-1-neg 99.8%

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

      3. unsub-neg 99.8%

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

   7. Simplified 99.8%

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

   8. Taylor expanded in x around inf 79.3%

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

   if -2.8e13 < x < 2.8000000000000002e-60

   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.4%

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

      1. mul-1-neg 76.4%

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

   7. Simplified 76.4%

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

4. Final simplification 77.8%

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

Alternative 3: 71.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{+14} \lor \neg \left(x \leq 2.5 \cdot 10^{-60}\right):\\ \;\;\;\;x \cdot \left(3 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1e+14) (not (<= x 2.5e-60))) (* x (* 3.0 y)) (- z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1e+14) || !(x <= 2.5e-60)) {
		tmp = x * (3.0 * y);
	} else {
		tmp = -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 <= (-1d+14)) .or. (.not. (x <= 2.5d-60))) then
        tmp = x * (3.0d0 * y)
    else
        tmp = -z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1e+14) || !(x <= 2.5e-60)) {
		tmp = x * (3.0 * y);
	} else {
		tmp = -z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1e+14) or not (x <= 2.5e-60):
		tmp = x * (3.0 * y)
	else:
		tmp = -z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1e+14) || !(x <= 2.5e-60))
		tmp = Float64(x * Float64(3.0 * y));
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1e+14) || ~((x <= 2.5e-60)))
		tmp = x * (3.0 * y);
	else
		tmp = -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1e+14], N[Not[LessEqual[x, 2.5e-60]], $MachinePrecision]], N[(x * N[(3.0 * y), $MachinePrecision]), $MachinePrecision], (-z)]

Derivation

1. Split input into 2 regimes

2. if x < -1e14 or 2.5000000000000001e-60 < x

   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 inf 99.8%

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

      1. +-commutative 99.8%

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

      2. mul-1-neg 99.8%

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

      3. unsub-neg 99.8%

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

   7. Simplified 99.8%

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

   8. Taylor expanded in x around inf 79.3%

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

      1. associate-*r* 79.4%

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

      2. *-commutative 79.4%

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

      3. associate-*r* 79.3%

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

   10. Simplified 79.3%

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

   if -1e14 < x < 2.5000000000000001e-60

   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.4%

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

      1. mul-1-neg 76.4%

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

   7. Simplified 76.4%

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

4. Final simplification 77.8%

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

Alternative 4: 71.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.1 \cdot 10^{+14}:\\ \;\;\;\;y \cdot \left(x \cdot 3\right)\\ \mathbf{elif}\;x \leq 2.8 \cdot 10^{-60}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(3 \cdot y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.1e+14)
   (* y (* x 3.0))
   (if (<= x 2.8e-60) (- z) (* x (* 3.0 y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.1e+14) {
		tmp = y * (x * 3.0);
	} else if (x <= 2.8e-60) {
		tmp = -z;
	} else {
		tmp = x * (3.0 * y);
	}
	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 <= (-1.1d+14)) then
        tmp = y * (x * 3.0d0)
    else if (x <= 2.8d-60) then
        tmp = -z
    else
        tmp = x * (3.0d0 * y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.1e+14) {
		tmp = y * (x * 3.0);
	} else if (x <= 2.8e-60) {
		tmp = -z;
	} else {
		tmp = x * (3.0 * y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.1e+14:
		tmp = y * (x * 3.0)
	elif x <= 2.8e-60:
		tmp = -z
	else:
		tmp = x * (3.0 * y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.1e+14)
		tmp = Float64(y * Float64(x * 3.0));
	elseif (x <= 2.8e-60)
		tmp = Float64(-z);
	else
		tmp = Float64(x * Float64(3.0 * y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.1e+14)
		tmp = y * (x * 3.0);
	elseif (x <= 2.8e-60)
		tmp = -z;
	else
		tmp = x * (3.0 * y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.1e+14], N[(y * N[(x * 3.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.8e-60], (-z), N[(x * N[(3.0 * y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.1e14

   1. Initial program 100.0%

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

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

      1. +-commutative 99.7%

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

      2. mul-1-neg 99.7%

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

      3. unsub-neg 99.7%

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

   7. Simplified 99.7%

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

   8. Taylor expanded in x around inf 83.0%

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

      1. associate-*r* 83.2%

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

   10. Simplified 83.2%

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

   if -1.1e14 < x < 2.8000000000000002e-60

   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.4%

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

      1. mul-1-neg 76.4%

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

   7. Simplified 76.4%

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

   if 2.8000000000000002e-60 < x

   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 inf 99.8%

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

      1. +-commutative 99.8%

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

      2. mul-1-neg 99.8%

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

      3. unsub-neg 99.8%

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

   7. Simplified 99.8%

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

   8. Taylor expanded in x around inf 77.5%

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

      1. associate-*r* 77.6%

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

      2. *-commutative 77.6%

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

      3. associate-*r* 77.5%

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

   10. Simplified 77.5%

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

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.1 \cdot 10^{+14}:\\ \;\;\;\;y \cdot \left(x \cdot 3\right)\\ \mathbf{elif}\;x \leq 2.8 \cdot 10^{-60}:\\ \;\;\;\;-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} \\ 3 \cdot \left(x \cdot y\right) - z \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(N[(3.0 * N[(x * y), $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.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. Final simplification 99.8%

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

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

Derivation

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. Final simplification 99.9%

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

Alternative 7: 50.3% accurate, 3.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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.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 50.9%

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

   1. mul-1-neg 50.9%

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

7. Simplified 50.9%

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

8. Final simplification 50.9%

   \[\leadsto -z \]
9. Add Preprocessing

Alternative 8: 2.2% accurate, 7.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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.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. Step-by-step derivation

   1. associate-*r* 99.9%

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

   2. *-commutative 99.9%

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

   3. associate-*r* 99.8%

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

   4. fmm-def 99.8%

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

   5. add-sqr-sqrt 46.6%

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

   6. sqrt-unprod 60.3%

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

   7. sqr-neg 60.3%

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

   8. sqrt-unprod 27.5%

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

   9. add-sqr-sqrt 50.5%

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

6. Applied egg-rr 50.5%

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

7. Taylor expanded in y around 0 2.4%

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

8. Final simplification 2.4%

   \[\leadsto z \]
9. 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 2024130 
(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))