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

Percentage Accurate: 69.8% → 76.7%

Time: 19.2s

Alternatives: 10

Speedup: 1.2×

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: 69.8% 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: 76.7% accurate, 1.1× 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.8%

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

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

   1. lower-cos.f64 77.8

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

5. Applied rewrites 77.8%

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

6. Final simplification 77.8%

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

Alternative 2: 67.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a}{3 \cdot b}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{-62}:\\ \;\;\;\;\frac{\frac{a}{-3}}{b}\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+26}:\\ \;\;\;\;\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(\mathsf{fma}\left(t, z \cdot -0.3333333333333333, y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a}{b}}{-3}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ a (* 3.0 b))))
   (if (<= t_1 -2e-62)
     (/ (/ a -3.0) b)
     (if (<= t_1 5e+26)
       (* (* 2.0 (sqrt x)) (cos (fma t (* z -0.3333333333333333) y)))
       (/ (/ a b) -3.0)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a / (3.0 * b);
	double tmp;
	if (t_1 <= -2e-62) {
		tmp = (a / -3.0) / b;
	} else if (t_1 <= 5e+26) {
		tmp = (2.0 * sqrt(x)) * cos(fma(t, (z * -0.3333333333333333), y));
	} else {
		tmp = (a / b) / -3.0;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(a / Float64(3.0 * b))
	tmp = 0.0
	if (t_1 <= -2e-62)
		tmp = Float64(Float64(a / -3.0) / b);
	elseif (t_1 <= 5e+26)
		tmp = Float64(Float64(2.0 * sqrt(x)) * cos(fma(t, Float64(z * -0.3333333333333333), y)));
	else
		tmp = Float64(Float64(a / b) / -3.0);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-62], N[(N[(a / -3.0), $MachinePrecision] / b), $MachinePrecision], If[LessEqual[t$95$1, 5e+26], N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(t * N[(z * -0.3333333333333333), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(a / b), $MachinePrecision] / -3.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 a (*.f64 b #s(literal 3 binary64))) < -2.0000000000000001e-62

   1. Initial program 86.2%

      \[\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 a around inf

      \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 82.2

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

   5. Applied rewrites 82.2%

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

   7. Applied rewrites 82.2%

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

   9. Applied rewrites 82.3%

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

   if -2.0000000000000001e-62 < (/.f64 a (*.f64 b #s(literal 3 binary64))) < 5.0000000000000001e26

   1. Initial program 57.0%

      \[\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 x around inf

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

   5. Applied rewrites 51.0%

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

   if 5.0000000000000001e26 < (/.f64 a (*.f64 b #s(literal 3 binary64)))

   1. Initial program 88.2%

      \[\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 a around inf

      \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 91.3

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

   5. Applied rewrites 91.3%

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

   7. Applied rewrites 91.6%

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

4. Final simplification 69.6%

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

Alternative 3: 76.7% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 72.8%

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

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

   1. lower-cos.f64 77.8

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

5. Applied rewrites 77.8%

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

   1. lift--.f64 N/A

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

   2. sub-neg N/A

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

   3. +-commutative N/A

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

   4. lift-/.f64 N/A

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

   5. distribute-neg-frac N/A

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

   6. neg-mul-1 N/A

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

   7. lift-*.f64 N/A

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

   8. *-commutative N/A

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

   9. times-frac N/A

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

   10. metadata-eval N/A

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

   11. associate-*r/ N/A

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

   12. *-commutative N/A

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

   13. associate-/l* N/A

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

   14. lower-fma.f64 N/A

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

   15. lower-/.f64 77.8

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

7. Applied rewrites 77.8%

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

Alternative 4: 76.6% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 72.8%

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

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

   1. cancel-sign-sub-inv N/A

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

   2. metadata-eval N/A

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

   3. lower-fma.f64 N/A

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

   4. lower-*.f64 N/A

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

   5. lower-sqrt.f64 N/A

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

   6. lower-cos.f64 N/A

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

   7. *-commutative N/A

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

   8. lower-*.f64 N/A

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

   9. lower-/.f64 77.8

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

5. Applied rewrites 77.8%

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

6. Final simplification 77.8%

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

Alternative 5: 50.5% accurate, 6.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 72.8%

   \[\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 a around inf

   \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 50.2

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

5. Applied rewrites 50.2%

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

7. Applied rewrites 50.2%

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

Alternative 6: 50.5% accurate, 6.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 72.8%

   \[\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 a around inf

   \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 50.2

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

5. Applied rewrites 50.2%

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

7. Applied rewrites 50.2%

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

9. Applied rewrites 50.2%

   \[\leadsto \frac{\frac{a}{-3}}{\color{blue}{b}} \]
10. Add Preprocessing

Alternative 7: 50.4% accurate, 6.9× speedup

Math

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

FPCore

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

C

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

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) / (b / a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 72.8%

   \[\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 a around inf

   \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 50.2

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

5. Applied rewrites 50.2%

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

7. Applied rewrites 50.2%

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

Alternative 8: 50.5% accurate, 9.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 72.8%

   \[\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 a around inf

   \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 50.2

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

5. Applied rewrites 50.2%

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

7. Applied rewrites 50.2%

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

Alternative 9: 50.4% accurate, 9.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.8%

   \[\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 a around inf

   \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 50.2

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

5. Applied rewrites 50.2%

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

6. Final simplification 50.2%

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

Alternative 10: 50.4% accurate, 9.4× speedup

Math

\[\begin{array}{l} \\ a \cdot \frac{-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(a * Float64(-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[(a * N[(-0.3333333333333333 / b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 72.8%

   \[\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 a around inf

   \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 50.2

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

5. Applied rewrites 50.2%

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

7. Applied rewrites 50.2%

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

Developer Target 1: 74.4% accurate, 0.8× 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 2024219 
(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))))