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

Percentage Accurate: 70.6% → 77.3%

Time: 41.2s

Alternatives: 9

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.6% 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.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := z \cdot \left(t \cdot -0.3333333333333333\right)\\ \mathbf{if}\;\cos \left(y - \frac{z \cdot t}{3}\right) \leq 0.8:\\ \;\;\;\;\mathsf{fma}\left(2, \sqrt{x} \cdot \left(\cos t\_1 \cdot \cos y - \sin t\_1 \cdot \sin y\right), a \cdot \frac{-0.3333333333333333}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(e^{\cos y}\right) \cdot \left(2 \cdot \sqrt{x}\right) - \frac{a}{3 \cdot b}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* z (* t -0.3333333333333333))))
   (if (<= (cos (- y (/ (* z t) 3.0))) 0.8)
     (fma
      2.0
      (* (sqrt x) (- (* (cos t_1) (cos y)) (* (sin t_1) (sin y))))
      (* a (/ -0.3333333333333333 b)))
     (- (* (log (exp (cos y))) (* 2.0 (sqrt x))) (/ a (* 3.0 b))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = z * (t * -0.3333333333333333);
	double tmp;
	if (cos((y - ((z * t) / 3.0))) <= 0.8) {
		tmp = fma(2.0, (sqrt(x) * ((cos(t_1) * cos(y)) - (sin(t_1) * sin(y)))), (a * (-0.3333333333333333 / b)));
	} else {
		tmp = (log(exp(cos(y))) * (2.0 * sqrt(x))) - (a / (3.0 * b));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(z * Float64(t * -0.3333333333333333))
	tmp = 0.0
	if (cos(Float64(y - Float64(Float64(z * t) / 3.0))) <= 0.8)
		tmp = fma(2.0, Float64(sqrt(x) * Float64(Float64(cos(t_1) * cos(y)) - Float64(sin(t_1) * sin(y)))), Float64(a * Float64(-0.3333333333333333 / b)));
	else
		tmp = Float64(Float64(log(exp(cos(y))) * Float64(2.0 * sqrt(x))) - Float64(a / Float64(3.0 * b)));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(z * N[(t * -0.3333333333333333), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.8], N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[(N[(N[Cos[t$95$1], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[t$95$1], $MachinePrecision] * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * N[(-0.3333333333333333 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Log[N[Exp[N[Cos[y], $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 (-.f64 y (/.f64 (*.f64 z t) #s(literal 3 binary64)))) < 0.80000000000000004

   1. Initial program 68.4%

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

   3. Simplified 68.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(2, \sqrt{x} \cdot \cos \left(\mathsf{fma}\left(z, t \cdot -0.3333333333333333, y\right)\right), a \cdot \frac{-0.3333333333333333}{b}\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 68.9%

         \[\leadsto \mathsf{fma}\left(2, \sqrt{x} \cdot \cos \color{blue}{\left(z \cdot \left(t \cdot -0.3333333333333333\right) + y\right)}, a \cdot \frac{-0.3333333333333333}{b}\right) \]

      2. cos-sum 70.8%

         \[\leadsto \mathsf{fma}\left(2, \sqrt{x} \cdot \color{blue}{\left(\cos \left(z \cdot \left(t \cdot -0.3333333333333333\right)\right) \cdot \cos y - \sin \left(z \cdot \left(t \cdot -0.3333333333333333\right)\right) \cdot \sin y\right)}, a \cdot \frac{-0.3333333333333333}{b}\right) \]

   6. Applied egg-rr 70.8%

      \[\leadsto \mathsf{fma}\left(2, \sqrt{x} \cdot \color{blue}{\left(\cos \left(z \cdot \left(t \cdot -0.3333333333333333\right)\right) \cdot \cos y - \sin \left(z \cdot \left(t \cdot -0.3333333333333333\right)\right) \cdot \sin y\right)}, a \cdot \frac{-0.3333333333333333}{b}\right) \]

   if 0.80000000000000004 < (cos.f64 (-.f64 y (/.f64 (*.f64 z t) #s(literal 3 binary64))))

   1. Initial program 66.1%

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

      1. *-commutative 66.1%

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

      2. *-commutative 66.1%

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

      3. *-commutative 66.1%

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

      4. *-commutative 66.1%

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

      5. associate-/l* 66.0%

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

      6. *-commutative 66.0%

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

   3. Simplified 66.0%

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

   5. Taylor expanded in z around 0 81.4%

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

      1. associate-*r* 81.4%

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

      2. *-commutative 81.4%

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

      3. *-commutative 81.4%

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

   7. Simplified 81.4%

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

      1. add-log-exp 81.4%

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

   9. Applied egg-rr 81.4%

      \[\leadsto \color{blue}{\log \left(e^{\cos y}\right)} \cdot \left(\sqrt{x} \cdot 2\right) - \frac{a}{3 \cdot b} \]
3. Recombined 2 regimes into one program.

4. Final simplification 75.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos \left(y - \frac{z \cdot t}{3}\right) \leq 0.8:\\ \;\;\;\;\mathsf{fma}\left(2, \sqrt{x} \cdot \left(\cos \left(z \cdot \left(t \cdot -0.3333333333333333\right)\right) \cdot \cos y - \sin \left(z \cdot \left(t \cdot -0.3333333333333333\right)\right) \cdot \sin y\right), a \cdot \frac{-0.3333333333333333}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(e^{\cos y}\right) \cdot \left(2 \cdot \sqrt{x}\right) - \frac{a}{3 \cdot b}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 65.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq -1.8 \cdot 10^{+195}:\\ \;\;\;\;2 \cdot \left(\sqrt{x} \cdot \cos y\right)\\ \mathbf{elif}\;b \leq 9 \cdot 10^{+96}:\\ \;\;\;\;2 \cdot \sqrt{x} - \frac{a}{3 \cdot b}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{x} \cdot \cos \left(y + -0.3333333333333333 \cdot \left(z \cdot t\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -1.8e+195)
   (* 2.0 (* (sqrt x) (cos y)))
   (if (<= b 9e+96)
     (- (* 2.0 (sqrt x)) (/ a (* 3.0 b)))
     (* 2.0 (* (sqrt x) (cos (+ y (* -0.3333333333333333 (* z t)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -1.8e+195) {
		tmp = 2.0 * (sqrt(x) * cos(y));
	} else if (b <= 9e+96) {
		tmp = (2.0 * sqrt(x)) - (a / (3.0 * b));
	} else {
		tmp = 2.0 * (sqrt(x) * cos((y + (-0.3333333333333333 * (z * t)))));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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 <= (-1.8d+195)) then
        tmp = 2.0d0 * (sqrt(x) * cos(y))
    else if (b <= 9d+96) then
        tmp = (2.0d0 * sqrt(x)) - (a / (3.0d0 * b))
    else
        tmp = 2.0d0 * (sqrt(x) * cos((y + ((-0.3333333333333333d0) * (z * t)))))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -1.8e+195) {
		tmp = 2.0 * (Math.sqrt(x) * Math.cos(y));
	} else if (b <= 9e+96) {
		tmp = (2.0 * Math.sqrt(x)) - (a / (3.0 * b));
	} else {
		tmp = 2.0 * (Math.sqrt(x) * Math.cos((y + (-0.3333333333333333 * (z * t)))));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if b <= -1.8e+195:
		tmp = 2.0 * (math.sqrt(x) * math.cos(y))
	elif b <= 9e+96:
		tmp = (2.0 * math.sqrt(x)) - (a / (3.0 * b))
	else:
		tmp = 2.0 * (math.sqrt(x) * math.cos((y + (-0.3333333333333333 * (z * t)))))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (b <= -1.8e+195)
		tmp = Float64(2.0 * Float64(sqrt(x) * cos(y)));
	elseif (b <= 9e+96)
		tmp = Float64(Float64(2.0 * sqrt(x)) - Float64(a / Float64(3.0 * b)));
	else
		tmp = Float64(2.0 * Float64(sqrt(x) * cos(Float64(y + Float64(-0.3333333333333333 * Float64(z * t))))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (b <= -1.8e+195)
		tmp = 2.0 * (sqrt(x) * cos(y));
	elseif (b <= 9e+96)
		tmp = (2.0 * sqrt(x)) - (a / (3.0 * b));
	else
		tmp = 2.0 * (sqrt(x) * cos((y + (-0.3333333333333333 * (z * t)))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -1.8e+195], N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 9e+96], N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[N[(y + N[(-0.3333333333333333 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.7999999999999999e195

   1. Initial program 45.6%

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

      1. *-commutative 45.6%

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

      2. *-commutative 45.6%

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

      3. *-commutative 45.6%

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

      4. *-commutative 45.6%

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

      5. associate-/l* 46.7%

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

      6. *-commutative 46.7%

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

   3. Simplified 46.7%

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

   5. Taylor expanded in z around 0 49.5%

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

      1. associate-*r* 49.5%

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

      2. *-commutative 49.5%

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

      3. *-commutative 49.5%

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

   7. Simplified 49.5%

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

      1. *-commutative 49.5%

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

      2. clear-num 49.4%

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

      3. inv-pow 49.4%

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

      4. *-commutative 49.4%

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

      5. *-un-lft-identity 49.4%

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

      6. times-frac 49.4%

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

      7. metadata-eval 49.4%

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

   9. Applied egg-rr 49.4%

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

   10. Taylor expanded in x around inf 44.5%

       \[\leadsto \color{blue}{2 \cdot \left(\sqrt{x} \cdot \cos y\right)} \]

   if -1.7999999999999999e195 < b < 8.99999999999999914e96

   1. Initial program 71.2%

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

      1. *-commutative 71.2%

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

      2. *-commutative 71.2%

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

      3. *-commutative 71.2%

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

      4. *-commutative 71.2%

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

      5. associate-/l* 71.2%

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

      6. *-commutative 71.2%

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

   3. Simplified 71.2%

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

   5. Taylor expanded in z around 0 80.4%

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

      1. associate-*r* 80.4%

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

      2. *-commutative 80.4%

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

      3. *-commutative 80.4%

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

   7. Simplified 80.4%

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

   8. Taylor expanded in y around 0 74.1%

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

   if 8.99999999999999914e96 < b

   1. Initial program 59.2%

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

   3. Simplified 59.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(2, \sqrt{x} \cdot \cos \left(\mathsf{fma}\left(z, t \cdot -0.3333333333333333, y\right)\right), a \cdot \frac{-0.3333333333333333}{b}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 50.9%

      \[\leadsto \color{blue}{2 \cdot \left(\sqrt{x} \cdot \cos \left(y + -0.3333333333333333 \cdot \left(t \cdot z\right)\right)\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 67.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.8 \cdot 10^{+195}:\\ \;\;\;\;2 \cdot \left(\sqrt{x} \cdot \cos y\right)\\ \mathbf{elif}\;b \leq 9 \cdot 10^{+96}:\\ \;\;\;\;2 \cdot \sqrt{x} - \frac{a}{3 \cdot b}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{x} \cdot \cos \left(y + -0.3333333333333333 \cdot \left(z \cdot t\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 65.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq -6 \cdot 10^{+200} \lor \neg \left(b \leq 1.65 \cdot 10^{+97}\right):\\ \;\;\;\;2 \cdot \left(\sqrt{x} \cdot \cos y\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{x} - \frac{a}{3 \cdot b}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -6e+200) (not (<= b 1.65e+97)))
   (* 2.0 (* (sqrt x) (cos y)))
   (- (* 2.0 (sqrt x)) (/ a (* 3.0 b)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -6e+200) || !(b <= 1.65e+97)) {
		tmp = 2.0 * (sqrt(x) * cos(y));
	} else {
		tmp = (2.0 * sqrt(x)) - (a / (3.0 * b));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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 <= (-6d+200)) .or. (.not. (b <= 1.65d+97))) then
        tmp = 2.0d0 * (sqrt(x) * cos(y))
    else
        tmp = (2.0d0 * sqrt(x)) - (a / (3.0d0 * b))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -6e+200) || !(b <= 1.65e+97)) {
		tmp = 2.0 * (Math.sqrt(x) * Math.cos(y));
	} else {
		tmp = (2.0 * Math.sqrt(x)) - (a / (3.0 * b));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -6e+200) or not (b <= 1.65e+97):
		tmp = 2.0 * (math.sqrt(x) * math.cos(y))
	else:
		tmp = (2.0 * math.sqrt(x)) - (a / (3.0 * b))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -6e+200) || !(b <= 1.65e+97))
		tmp = Float64(2.0 * Float64(sqrt(x) * cos(y)));
	else
		tmp = Float64(Float64(2.0 * sqrt(x)) - Float64(a / Float64(3.0 * b)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -6e+200) || ~((b <= 1.65e+97)))
		tmp = 2.0 * (sqrt(x) * cos(y));
	else
		tmp = (2.0 * sqrt(x)) - (a / (3.0 * b));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -6e+200], N[Not[LessEqual[b, 1.65e+97]], $MachinePrecision]], N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -5.99999999999999982e200 or 1.6500000000000001e97 < b

   1. Initial program 55.1%

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

      1. *-commutative 55.1%

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

      2. *-commutative 55.1%

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

      3. *-commutative 55.1%

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

      4. *-commutative 55.1%

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

      5. associate-/l* 55.8%

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

      6. *-commutative 55.8%

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

   3. Simplified 55.8%

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

   5. Taylor expanded in z around 0 55.7%

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

      1. associate-*r* 55.7%

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

      2. *-commutative 55.7%

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

      3. *-commutative 55.7%

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

   7. Simplified 55.7%

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

      1. *-commutative 55.7%

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

      2. clear-num 55.7%

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

      3. inv-pow 55.7%

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

      4. *-commutative 55.7%

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

      5. *-un-lft-identity 55.7%

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

      6. times-frac 55.7%

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

      7. metadata-eval 55.7%

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

   9. Applied egg-rr 55.7%

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

   10. Taylor expanded in x around inf 47.7%

       \[\leadsto \color{blue}{2 \cdot \left(\sqrt{x} \cdot \cos y\right)} \]

   if -5.99999999999999982e200 < b < 1.6500000000000001e97

   1. Initial program 71.2%

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

      1. *-commutative 71.2%

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

      2. *-commutative 71.2%

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

      3. *-commutative 71.2%

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

      4. *-commutative 71.2%

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

      5. associate-/l* 71.2%

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

      6. *-commutative 71.2%

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

   3. Simplified 71.2%

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

   5. Taylor expanded in z around 0 80.4%

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

      1. associate-*r* 80.4%

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

      2. *-commutative 80.4%

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

      3. *-commutative 80.4%

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

   7. Simplified 80.4%

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

   8. Taylor expanded in y around 0 74.1%

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

4. Final simplification 67.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -6 \cdot 10^{+200} \lor \neg \left(b \leq 1.65 \cdot 10^{+97}\right):\\ \;\;\;\;2 \cdot \left(\sqrt{x} \cdot \cos y\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{x} - \frac{a}{3 \cdot b}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 76.5% accurate, 1.0× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (- (* (cos y) (* 2.0 (sqrt x))) (/ a (* 3.0 b))))

C

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

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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 = (cos(y) * (2.0d0 * sqrt(x))) - (a / (3.0d0 * b))
end function

Java

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

Python

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

Julia

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

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
	tmp = (cos(y) * (2.0 * sqrt(x))) - (a / (3.0 * b));
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[Cos[y], $MachinePrecision] * N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 67.3%

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

   1. *-commutative 67.3%

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

   2. *-commutative 67.3%

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

   3. *-commutative 67.3%

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

   4. *-commutative 67.3%

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

   5. associate-/l* 67.4%

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

   6. *-commutative 67.4%

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

3. Simplified 67.4%

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

5. Taylor expanded in z around 0 74.4%

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

   1. associate-*r* 74.4%

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

   2. *-commutative 74.4%

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

   3. *-commutative 74.4%

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

7. Simplified 74.4%

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

8. Final simplification 74.4%

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

Alternative 5: 76.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ -0.3333333333333333 \cdot \frac{a}{b} + 2 \cdot \left(\sqrt{x} \cdot \cos y\right) \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (+ (* -0.3333333333333333 (/ a b)) (* 2.0 (* (sqrt x) (cos y)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	return (-0.3333333333333333 * (a / b)) + (2.0 * (sqrt(x) * cos(y)));
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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)) + (2.0d0 * (sqrt(x) * cos(y)))
end function

Java

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

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	return (-0.3333333333333333 * (a / b)) + (2.0 * (math.sqrt(x) * math.cos(y)))

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	return Float64(Float64(-0.3333333333333333 * Float64(a / b)) + Float64(2.0 * Float64(sqrt(x) * cos(y))))
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
	tmp = (-0.3333333333333333 * (a / b)) + (2.0 * (sqrt(x) * cos(y)));
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := N[(N[(-0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 67.3%

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

3. Simplified 67.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(2, \sqrt{x} \cdot \cos \left(\mathsf{fma}\left(z, t \cdot -0.3333333333333333, y\right)\right), a \cdot \frac{-0.3333333333333333}{b}\right)} \]
4. Add Preprocessing

5. Taylor expanded in z around 0 74.3%

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

Alternative 6: 65.3% accurate, 2.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ 2 \cdot \sqrt{x} - \frac{a}{3 \cdot b} \end{array} \]

FPCore

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

C

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

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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

assert x < y && y < z && z < t && t < a && a < b;
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

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

Julia

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

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
	tmp = (2.0 * sqrt(x)) - (a / (3.0 * b));
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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 67.3%

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

   1. *-commutative 67.3%

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

   2. *-commutative 67.3%

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

   3. *-commutative 67.3%

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

   4. *-commutative 67.3%

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

   5. associate-/l* 67.4%

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

   6. *-commutative 67.4%

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

3. Simplified 67.4%

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

5. Taylor expanded in z around 0 74.4%

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

   1. associate-*r* 74.4%

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

   2. *-commutative 74.4%

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

   3. *-commutative 74.4%

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

7. Simplified 74.4%

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

8. Taylor expanded in y around 0 63.8%

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

Alternative 7: 50.0% accurate, 43.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \frac{-0.3333333333333333}{\frac{b}{a}} \end{array} \]

FPCore

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

C

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

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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) / (b / a)
end function

Java

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

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	return -0.3333333333333333 / (b / a)

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	return Float64(-0.3333333333333333 / Float64(b / a))
end

MATLAB

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

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := N[(-0.3333333333333333 / N[(b / a), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 67.3%

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

3. Simplified 67.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(2, \sqrt{x} \cdot \cos \left(\mathsf{fma}\left(z, t \cdot -0.3333333333333333, y\right)\right), a \cdot \frac{-0.3333333333333333}{b}\right)} \]
4. Add Preprocessing

5. Taylor expanded in a around inf 52.1%

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

   1. clear-num 52.1%

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

   2. un-div-inv 52.2%

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

7. Applied egg-rr 52.2%

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

Alternative 8: 50.0% accurate, 43.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ a \cdot \frac{-0.3333333333333333}{b} \end{array} \]

FPCore

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

C

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

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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

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

Python

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

Julia

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

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
	tmp = a * (-0.3333333333333333 / b);
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := N[(a * N[(-0.3333333333333333 / b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 67.3%

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

3. Simplified 67.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(2, \sqrt{x} \cdot \cos \left(\mathsf{fma}\left(z, t \cdot -0.3333333333333333, y\right)\right), a \cdot \frac{-0.3333333333333333}{b}\right)} \]
4. Add Preprocessing

5. Taylor expanded in a around inf 52.1%

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

   1. associate-*r/ 52.1%

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

   2. *-commutative 52.1%

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

   3. associate-*r/ 52.2%

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

7. Simplified 52.2%

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

Alternative 9: 50.0% accurate, 43.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ -0.3333333333333333 \cdot \frac{a}{b} \end{array} \]

FPCore

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

C

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

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
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

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

Python

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

Julia

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

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
	tmp = -0.3333333333333333 * (a / b);
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := N[(-0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 67.3%

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

3. Simplified 67.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(2, \sqrt{x} \cdot \cos \left(\mathsf{fma}\left(z, t \cdot -0.3333333333333333, y\right)\right), a \cdot \frac{-0.3333333333333333}{b}\right)} \]
4. Add Preprocessing

5. Taylor expanded in a around inf 52.1%

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

Developer Target 1: 74.0% 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 2024143 
(FPCore (x y z t a b)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, K"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -1379333748723514100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (* (* 2 (sqrt x)) (cos (- (/ 1 y) (/ (/ 3333333333333333/10000000000000000 z) t)))) (/ (/ a 3) b)) (if (< z 35162906135559870000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (* (* (sqrt x) 2) (cos (- y (* (/ t 3) z)))) (/ (/ a 3) b)) (- (* (cos (- y (/ (/ 3333333333333333/10000000000000000 z) t))) (* 2 (sqrt x))) (/ (/ a b) 3)))))

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