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

Percentage Accurate: 70.2% → 77.0%

Time: 44.4s

Alternatives: 7

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((2.0d0 * sqrt(x)) * cos((y - ((z * t) / 3.0d0)))) - (a / (b * 3.0d0))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * Math.sqrt(x)) * Math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}

Python

def code(x, y, z, t, a, b):
	return ((2.0 * math.sqrt(x)) * math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) - Float64(a / Float64(b * 3.0)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 70.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((2.0d0 * sqrt(x)) * cos((y - ((z * t) / 3.0d0)))) - (a / (b * 3.0d0))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * Math.sqrt(x)) * Math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}

Python

def code(x, y, z, t, a, b):
	return ((2.0 * math.sqrt(x)) * math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) - Float64(a / Float64(b * 3.0)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 77.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(2 \cdot \sqrt{x}\right) \cdot \cos y - \frac{\frac{a}{3}}{b} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (- (* (* 2.0 (sqrt x)) (cos y)) (/ (/ a 3.0) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * sqrt(x)) * cos(y)) - ((a / 3.0) / b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((2.0d0 * sqrt(x)) * cos(y)) - ((a / 3.0d0) / b)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * Math.sqrt(x)) * Math.cos(y)) - ((a / 3.0) / b);
}

Python

def code(x, y, z, t, a, b):
	return ((2.0 * math.sqrt(x)) * math.cos(y)) - ((a / 3.0) / b)

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(y)) - Float64(Float64(a / 3.0) / b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((2.0 * sqrt(x)) * cos(y)) - ((a / 3.0) / b);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision] - N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 72.6%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in z around 0 78.0%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]
4. Step-by-step derivation

   1. *-commutative 78.0%

      \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \cos y - \frac{a}{\color{blue}{3 \cdot b}} \]

   2. associate-/r* 78.0%

      \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \cos y - \color{blue}{\frac{\frac{a}{3}}{b}} \]

5. Applied egg-rr 78.0%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \cos y - \color{blue}{\frac{\frac{a}{3}}{b}} \]
6. Add Preprocessing

Alternative 2: 77.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(2 \cdot \sqrt{x}\right) \cdot \cos y - \frac{a}{3 \cdot b} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (- (* (* 2.0 (sqrt x)) (cos y)) (/ a (* 3.0 b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * sqrt(x)) * cos(y)) - (a / (3.0 * b));
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((2.0d0 * sqrt(x)) * cos(y)) - (a / (3.0d0 * b))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * Math.sqrt(x)) * Math.cos(y)) - (a / (3.0 * b));
}

Python

def code(x, y, z, t, a, b):
	return ((2.0 * math.sqrt(x)) * math.cos(y)) - (a / (3.0 * b))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(y)) - Float64(a / Float64(3.0 * b)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((2.0 * sqrt(x)) * cos(y)) - (a / (3.0 * b));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 72.6%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in z around 0 78.0%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]

4. Final simplification 78.0%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \cos y - \frac{a}{3 \cdot b} \]
5. Add Preprocessing

Alternative 3: 53.2% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.45 \cdot 10^{+157} \lor \neg \left(b \leq 7.2 \cdot 10^{+147}\right):\\ \;\;\;\;2 \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{a \cdot -0.3333333333333333}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -2.45e+157) (not (<= b 7.2e+147)))
   (* 2.0 (sqrt x))
   (/ (* a -0.3333333333333333) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -2.45e+157) || !(b <= 7.2e+147)) {
		tmp = 2.0 * sqrt(x);
	} else {
		tmp = (a * -0.3333333333333333) / b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b <= (-2.45d+157)) .or. (.not. (b <= 7.2d+147))) then
        tmp = 2.0d0 * sqrt(x)
    else
        tmp = (a * (-0.3333333333333333d0)) / b
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -2.45e+157) || !(b <= 7.2e+147)) {
		tmp = 2.0 * Math.sqrt(x);
	} else {
		tmp = (a * -0.3333333333333333) / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -2.45e+157) or not (b <= 7.2e+147):
		tmp = 2.0 * math.sqrt(x)
	else:
		tmp = (a * -0.3333333333333333) / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -2.45e+157) || !(b <= 7.2e+147))
		tmp = Float64(2.0 * sqrt(x));
	else
		tmp = Float64(Float64(a * -0.3333333333333333) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -2.45e+157) || ~((b <= 7.2e+147)))
		tmp = 2.0 * sqrt(x);
	else
		tmp = (a * -0.3333333333333333) / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -2.45e+157], N[Not[LessEqual[b, 7.2e+147]], $MachinePrecision]], N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(N[(a * -0.3333333333333333), $MachinePrecision] / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -2.4500000000000001e157 or 7.20000000000000041e147 < b

   1. Initial program 62.6%

      \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 62.5%

      \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]

   4. Taylor expanded in y around 0 39.7%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x}} - \frac{a}{b \cdot 3} \]

   5. Taylor expanded in x around inf 35.9%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x}} \]

   if -2.4500000000000001e157 < b < 7.20000000000000041e147

   1. Initial program 76.1%

      \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 83.5%

      \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]

   4. Taylor expanded in y around 0 75.1%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x}} - \frac{a}{b \cdot 3} \]

   5. Taylor expanded in a around inf 62.9%

      \[\leadsto \color{blue}{-0.3333333333333333 \cdot \frac{a}{b}} \]
   6. Step-by-step derivation

      1. associate-*r/ 62.9%

         \[\leadsto \color{blue}{\frac{-0.3333333333333333 \cdot a}{b}} \]

   7. Applied egg-rr 62.9%

      \[\leadsto \color{blue}{\frac{-0.3333333333333333 \cdot a}{b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 55.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.45 \cdot 10^{+157} \lor \neg \left(b \leq 7.2 \cdot 10^{+147}\right):\\ \;\;\;\;2 \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{a \cdot -0.3333333333333333}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 65.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ 2 \cdot \sqrt{x} - \frac{\frac{a}{3}}{b} \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (- (* 2.0 (sqrt x)) (/ (/ a 3.0) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (2.0 * sqrt(x)) - ((a / 3.0) / b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (2.0d0 * sqrt(x)) - ((a / 3.0d0) / b)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return (2.0 * Math.sqrt(x)) - ((a / 3.0) / b);
}

Python

def code(x, y, z, t, a, b):
	return (2.0 * math.sqrt(x)) - ((a / 3.0) / b)

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(2.0 * sqrt(x)) - Float64(Float64(a / 3.0) / b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = (2.0 * sqrt(x)) - ((a / 3.0) / b);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 72.6%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in z around 0 78.0%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]
4. Step-by-step derivation

   1. *-commutative 78.0%

      \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \cos y - \frac{a}{\color{blue}{3 \cdot b}} \]

   2. associate-/r* 78.0%

      \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \cos y - \color{blue}{\frac{\frac{a}{3}}{b}} \]

5. Applied egg-rr 78.0%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \cos y - \color{blue}{\frac{\frac{a}{3}}{b}} \]

6. Taylor expanded in y around 0 65.8%

   \[\leadsto \color{blue}{2 \cdot \sqrt{x}} - \frac{\frac{a}{3}}{b} \]
7. Add Preprocessing

Alternative 5: 65.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ 2 \cdot \sqrt{x} - \frac{a}{3 \cdot b} \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (- (* 2.0 (sqrt x)) (/ a (* 3.0 b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (2.0 * sqrt(x)) - (a / (3.0 * b));
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (2.0d0 * sqrt(x)) - (a / (3.0d0 * b))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return (2.0 * Math.sqrt(x)) - (a / (3.0 * b));
}

Python

def code(x, y, z, t, a, b):
	return (2.0 * math.sqrt(x)) - (a / (3.0 * b))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(2.0 * sqrt(x)) - Float64(a / Float64(3.0 * b)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = (2.0 * sqrt(x)) - (a / (3.0 * b));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 72.6%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in z around 0 78.0%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]

4. Taylor expanded in y around 0 65.8%

   \[\leadsto \color{blue}{2 \cdot \sqrt{x}} - \frac{a}{b \cdot 3} \]

5. Final simplification 65.8%

   \[\leadsto 2 \cdot \sqrt{x} - \frac{a}{3 \cdot b} \]
6. Add Preprocessing

Alternative 6: 50.4% accurate, 43.4× speedup

Math

\[\begin{array}{l} \\ \frac{a \cdot -0.3333333333333333}{b} \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (/ (* a -0.3333333333333333) b))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (a * -0.3333333333333333) / b;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (a * (-0.3333333333333333d0)) / b
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return (a * -0.3333333333333333) / b;
}

Python

def code(x, y, z, t, a, b):
	return (a * -0.3333333333333333) / b

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(a * -0.3333333333333333) / b)
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = (a * -0.3333333333333333) / b;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(a * -0.3333333333333333), $MachinePrecision] / b), $MachinePrecision]

Derivation

1. Initial program 72.6%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in z around 0 78.0%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]

4. Taylor expanded in y around 0 65.8%

   \[\leadsto \color{blue}{2 \cdot \sqrt{x}} - \frac{a}{b \cdot 3} \]

5. Taylor expanded in a around inf 48.3%

   \[\leadsto \color{blue}{-0.3333333333333333 \cdot \frac{a}{b}} \]
6. Step-by-step derivation

   1. associate-*r/ 48.3%

      \[\leadsto \color{blue}{\frac{-0.3333333333333333 \cdot a}{b}} \]

7. Applied egg-rr 48.3%

   \[\leadsto \color{blue}{\frac{-0.3333333333333333 \cdot a}{b}} \]

8. Final simplification 48.3%

   \[\leadsto \frac{a \cdot -0.3333333333333333}{b} \]
9. Add Preprocessing

Alternative 7: 50.3% accurate, 43.4× speedup

Math

\[\begin{array}{l} \\ -0.3333333333333333 \cdot \frac{a}{b} \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (* -0.3333333333333333 (/ a b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return -0.3333333333333333 * (a / b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (-0.3333333333333333d0) * (a / b)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return -0.3333333333333333 * (a / b);
}

Python

def code(x, y, z, t, a, b):
	return -0.3333333333333333 * (a / b)

Julia

function code(x, y, z, t, a, b)
	return Float64(-0.3333333333333333 * Float64(a / b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = -0.3333333333333333 * (a / b);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(-0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 72.6%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in z around 0 78.0%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]

4. Taylor expanded in y around 0 65.8%

   \[\leadsto \color{blue}{2 \cdot \sqrt{x}} - \frac{a}{b \cdot 3} \]

5. Taylor expanded in a around inf 48.3%

   \[\leadsto \color{blue}{-0.3333333333333333 \cdot \frac{a}{b}} \]
6. Add Preprocessing

Developer target: 74.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\frac{0.3333333333333333}{z}}{t}\\ t_2 := \frac{\frac{a}{3}}{b}\\ t_3 := 2 \cdot \sqrt{x}\\ \mathbf{if}\;z < -1.3793337487235141 \cdot 10^{+129}:\\ \;\;\;\;t\_3 \cdot \cos \left(\frac{1}{y} - t\_1\right) - t\_2\\ \mathbf{elif}\;z < 3.516290613555987 \cdot 10^{+106}:\\ \;\;\;\;\left(\sqrt{x} \cdot 2\right) \cdot \cos \left(y - \frac{t}{3} \cdot z\right) - t\_2\\ \mathbf{else}:\\ \;\;\;\;\cos \left(y - t\_1\right) \cdot t\_3 - \frac{\frac{a}{b}}{3}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (/ 0.3333333333333333 z) t))
        (t_2 (/ (/ a 3.0) b))
        (t_3 (* 2.0 (sqrt x))))
   (if (< z -1.3793337487235141e+129)
     (- (* t_3 (cos (- (/ 1.0 y) t_1))) t_2)
     (if (< z 3.516290613555987e+106)
       (- (* (* (sqrt x) 2.0) (cos (- y (* (/ t 3.0) z)))) t_2)
       (- (* (cos (- y t_1)) t_3) (/ (/ a b) 3.0))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (0.3333333333333333 / z) / t;
	double t_2 = (a / 3.0) / b;
	double t_3 = 2.0 * sqrt(x);
	double tmp;
	if (z < -1.3793337487235141e+129) {
		tmp = (t_3 * cos(((1.0 / y) - t_1))) - t_2;
	} else if (z < 3.516290613555987e+106) {
		tmp = ((sqrt(x) * 2.0) * cos((y - ((t / 3.0) * z)))) - t_2;
	} else {
		tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = (0.3333333333333333d0 / z) / t
    t_2 = (a / 3.0d0) / b
    t_3 = 2.0d0 * sqrt(x)
    if (z < (-1.3793337487235141d+129)) then
        tmp = (t_3 * cos(((1.0d0 / y) - t_1))) - t_2
    else if (z < 3.516290613555987d+106) then
        tmp = ((sqrt(x) * 2.0d0) * cos((y - ((t / 3.0d0) * z)))) - t_2
    else
        tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (0.3333333333333333 / z) / t;
	double t_2 = (a / 3.0) / b;
	double t_3 = 2.0 * Math.sqrt(x);
	double tmp;
	if (z < -1.3793337487235141e+129) {
		tmp = (t_3 * Math.cos(((1.0 / y) - t_1))) - t_2;
	} else if (z < 3.516290613555987e+106) {
		tmp = ((Math.sqrt(x) * 2.0) * Math.cos((y - ((t / 3.0) * z)))) - t_2;
	} else {
		tmp = (Math.cos((y - t_1)) * t_3) - ((a / b) / 3.0);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (0.3333333333333333 / z) / t
	t_2 = (a / 3.0) / b
	t_3 = 2.0 * math.sqrt(x)
	tmp = 0
	if z < -1.3793337487235141e+129:
		tmp = (t_3 * math.cos(((1.0 / y) - t_1))) - t_2
	elif z < 3.516290613555987e+106:
		tmp = ((math.sqrt(x) * 2.0) * math.cos((y - ((t / 3.0) * z)))) - t_2
	else:
		tmp = (math.cos((y - t_1)) * t_3) - ((a / b) / 3.0)
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(0.3333333333333333 / z) / t)
	t_2 = Float64(Float64(a / 3.0) / b)
	t_3 = Float64(2.0 * sqrt(x))
	tmp = 0.0
	if (z < -1.3793337487235141e+129)
		tmp = Float64(Float64(t_3 * cos(Float64(Float64(1.0 / y) - t_1))) - t_2);
	elseif (z < 3.516290613555987e+106)
		tmp = Float64(Float64(Float64(sqrt(x) * 2.0) * cos(Float64(y - Float64(Float64(t / 3.0) * z)))) - t_2);
	else
		tmp = Float64(Float64(cos(Float64(y - t_1)) * t_3) - Float64(Float64(a / b) / 3.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (0.3333333333333333 / z) / t;
	t_2 = (a / 3.0) / b;
	t_3 = 2.0 * sqrt(x);
	tmp = 0.0;
	if (z < -1.3793337487235141e+129)
		tmp = (t_3 * cos(((1.0 / y) - t_1))) - t_2;
	elseif (z < 3.516290613555987e+106)
		tmp = ((sqrt(x) * 2.0) * cos((y - ((t / 3.0) * z)))) - t_2;
	else
		tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(0.3333333333333333 / z), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[Less[z, -1.3793337487235141e+129], N[(N[(t$95$3 * N[Cos[N[(N[(1.0 / y), $MachinePrecision] - t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[z, 3.516290613555987e+106], N[(N[(N[(N[Sqrt[x], $MachinePrecision] * 2.0), $MachinePrecision] * N[Cos[N[(y - N[(N[(t / 3.0), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision], N[(N[(N[Cos[N[(y - t$95$1), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision] - N[(N[(a / b), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]]]]]]

Reproduce

herbie shell --seed 2024097 
(FPCore (x y z t a b)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, K"
  :precision binary64

  :alt
  (if (< z -1.3793337487235141e+129) (- (* (* 2.0 (sqrt x)) (cos (- (/ 1.0 y) (/ (/ 0.3333333333333333 z) t)))) (/ (/ a 3.0) b)) (if (< z 3.516290613555987e+106) (- (* (* (sqrt x) 2.0) (cos (- y (* (/ t 3.0) z)))) (/ (/ a 3.0) b)) (- (* (cos (- y (/ (/ 0.3333333333333333 z) t))) (* 2.0 (sqrt x))) (/ (/ a b) 3.0))))

  (- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))