2cbrt (problem 3.3.4)

Percentage Accurate: 6.8% → 98.4%

Time: 5.9s

Alternatives: 14

Speedup: 1.7×

Specification

\[x > 1 \land x < 10^{+308}\]

Math

\[\begin{array}{l} \\ \sqrt[3]{x + 1} - \sqrt[3]{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (cbrt (+ x 1.0)) (cbrt x)))

C

double code(double x) {
	return cbrt((x + 1.0)) - cbrt(x);
}

Java

public static double code(double x) {
	return Math.cbrt((x + 1.0)) - Math.cbrt(x);
}

Julia

function code(x)
	return Float64(cbrt(Float64(x + 1.0)) - cbrt(x))
end

Wolfram

code[x_] := N[(N[Power[N[(x + 1.0), $MachinePrecision], 1/3], $MachinePrecision] - N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision]

Initial Program: 6.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt[3]{x + 1} - \sqrt[3]{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (cbrt (+ x 1.0)) (cbrt x)))

C

double code(double x) {
	return cbrt((x + 1.0)) - cbrt(x);
}

Java

public static double code(double x) {
	return Math.cbrt((x + 1.0)) - Math.cbrt(x);
}

Julia

function code(x)
	return Float64(cbrt(Float64(x + 1.0)) - cbrt(x))
end

Wolfram

code[x_] := N[(N[Power[N[(x + 1.0), $MachinePrecision], 1/3], $MachinePrecision] - N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 5 \cdot 10^{+15}:\\ \;\;\;\;\frac{\left(x - -1\right) - x}{{\left(\sqrt[3]{x - -1}\right)}^{2} + \left({\left(\sqrt[3]{x}\right)}^{2} + \sqrt[3]{\left(x - -1\right) \cdot x}\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 5e+15)
   (/
    (- (- x -1.0) x)
    (+
     (pow (cbrt (- x -1.0)) 2.0)
     (+ (pow (cbrt x) 2.0) (cbrt (* (- x -1.0) x)))))
   (/ (/ -0.3333333333333333 (cbrt x)) (cbrt (- x)))))

C

double code(double x) {
	double tmp;
	if (x <= 5e+15) {
		tmp = ((x - -1.0) - x) / (pow(cbrt((x - -1.0)), 2.0) + (pow(cbrt(x), 2.0) + cbrt(((x - -1.0) * x))));
	} else {
		tmp = (-0.3333333333333333 / cbrt(x)) / cbrt(-x);
	}
	return tmp;
}

Java

public static double code(double x) {
	double tmp;
	if (x <= 5e+15) {
		tmp = ((x - -1.0) - x) / (Math.pow(Math.cbrt((x - -1.0)), 2.0) + (Math.pow(Math.cbrt(x), 2.0) + Math.cbrt(((x - -1.0) * x))));
	} else {
		tmp = (-0.3333333333333333 / Math.cbrt(x)) / Math.cbrt(-x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 5e+15)
		tmp = Float64(Float64(Float64(x - -1.0) - x) / Float64((cbrt(Float64(x - -1.0)) ^ 2.0) + Float64((cbrt(x) ^ 2.0) + cbrt(Float64(Float64(x - -1.0) * x)))));
	else
		tmp = Float64(Float64(-0.3333333333333333 / cbrt(x)) / cbrt(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 5e+15], N[(N[(N[(x - -1.0), $MachinePrecision] - x), $MachinePrecision] / N[(N[Power[N[Power[N[(x - -1.0), $MachinePrecision], 1/3], $MachinePrecision], 2.0], $MachinePrecision] + N[(N[Power[N[Power[x, 1/3], $MachinePrecision], 2.0], $MachinePrecision] + N[Power[N[(N[(x - -1.0), $MachinePrecision] * x), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-0.3333333333333333 / N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision] / N[Power[(-x), 1/3], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 5e15

   1. Initial program 58.8%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-cbrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt[3]{x + 1}} - \sqrt[3]{x} \]

      2. pow1/3 N/A

         \[\leadsto \color{blue}{{\left(x + 1\right)}^{\frac{1}{3}}} - \sqrt[3]{x} \]

      3. lower-pow.f64 57.1

         \[\leadsto \color{blue}{{\left(x + 1\right)}^{0.3333333333333333}} - \sqrt[3]{x} \]

      4. lift-+.f64 N/A

         \[\leadsto {\color{blue}{\left(x + 1\right)}}^{\frac{1}{3}} - \sqrt[3]{x} \]

      5. metadata-eval N/A

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

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto {\color{blue}{\left(x - \left(\mathsf{neg}\left(1\right)\right) \cdot 1\right)}}^{\frac{1}{3}} - \sqrt[3]{x} \]

      7. metadata-eval N/A

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

      8. metadata-eval N/A

         \[\leadsto {\left(x - \color{blue}{-1}\right)}^{\frac{1}{3}} - \sqrt[3]{x} \]

      9. metadata-eval N/A

         \[\leadsto {\left(x - \color{blue}{\left(\mathsf{neg}\left(1\right)\right)}\right)}^{\frac{1}{3}} - \sqrt[3]{x} \]

      10. lower--.f64 N/A

          \[\leadsto {\color{blue}{\left(x - \left(\mathsf{neg}\left(1\right)\right)\right)}}^{\frac{1}{3}} - \sqrt[3]{x} \]

      11. metadata-eval 57.1

          \[\leadsto {\left(x - \color{blue}{-1}\right)}^{0.3333333333333333} - \sqrt[3]{x} \]

   4. Applied rewrites 57.1%

      \[\leadsto \color{blue}{{\left(x - -1\right)}^{0.3333333333333333}} - \sqrt[3]{x} \]
   5. Step-by-step derivation

      1. lift-cbrt.f64 N/A

         \[\leadsto {\left(x - -1\right)}^{\frac{1}{3}} - \color{blue}{\sqrt[3]{x}} \]

      2. pow1/3 N/A

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

      3. metadata-eval N/A

         \[\leadsto {\left(x - -1\right)}^{\frac{1}{3}} - {x}^{\color{blue}{\left(\frac{1}{6} + \frac{1}{6}\right)}} \]

      4. pow-prod-up N/A

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

      5. pow-prod-down N/A

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

      6. lift-*.f64 N/A

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

      7. lower-pow.f64 61.6

         \[\leadsto {\left(x - -1\right)}^{0.3333333333333333} - \color{blue}{{\left(x \cdot x\right)}^{0.16666666666666666}} \]

   6. Applied rewrites 61.6%

      \[\leadsto {\left(x - -1\right)}^{0.3333333333333333} - \color{blue}{{\left(x \cdot x\right)}^{0.16666666666666666}} \]

   8. Applied rewrites 99.5%

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

   if 5e15 < x

   1. Initial program 4.2%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 54.5%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.3%

      \[\leadsto \frac{\sqrt[3]{\frac{-1}{x}}}{\sqrt[3]{-x}} \cdot 0.3333333333333333 \]
   8. Step-by-step derivation

   9. Applied rewrites 98.4%

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

4. Final simplification 98.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 5 \cdot 10^{+15}:\\ \;\;\;\;\frac{\left(x - -1\right) - x}{{\left(\sqrt[3]{x - -1}\right)}^{2} + \left({\left(\sqrt[3]{x}\right)}^{2} + \sqrt[3]{\left(x - -1\right) \cdot x}\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 98.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt[3]{x - -1}\\ \mathbf{if}\;x \leq 5 \cdot 10^{+15}:\\ \;\;\;\;\frac{\left(x - -1\right) - x}{\mathsf{fma}\left(\sqrt[3]{x}, \sqrt[3]{x} + t\_0, {t\_0}^{2}\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (cbrt (- x -1.0))))
   (if (<= x 5e+15)
     (/ (- (- x -1.0) x) (fma (cbrt x) (+ (cbrt x) t_0) (pow t_0 2.0)))
     (/ (/ -0.3333333333333333 (cbrt x)) (cbrt (- x))))))

C

double code(double x) {
	double t_0 = cbrt((x - -1.0));
	double tmp;
	if (x <= 5e+15) {
		tmp = ((x - -1.0) - x) / fma(cbrt(x), (cbrt(x) + t_0), pow(t_0, 2.0));
	} else {
		tmp = (-0.3333333333333333 / cbrt(x)) / cbrt(-x);
	}
	return tmp;
}

Julia

function code(x)
	t_0 = cbrt(Float64(x - -1.0))
	tmp = 0.0
	if (x <= 5e+15)
		tmp = Float64(Float64(Float64(x - -1.0) - x) / fma(cbrt(x), Float64(cbrt(x) + t_0), (t_0 ^ 2.0)));
	else
		tmp = Float64(Float64(-0.3333333333333333 / cbrt(x)) / cbrt(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Power[N[(x - -1.0), $MachinePrecision], 1/3], $MachinePrecision]}, If[LessEqual[x, 5e+15], N[(N[(N[(x - -1.0), $MachinePrecision] - x), $MachinePrecision] / N[(N[Power[x, 1/3], $MachinePrecision] * N[(N[Power[x, 1/3], $MachinePrecision] + t$95$0), $MachinePrecision] + N[Power[t$95$0, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-0.3333333333333333 / N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision] / N[Power[(-x), 1/3], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < 5e15

   1. Initial program 58.8%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\sqrt[3]{x + 1} - \sqrt[3]{x}} \]

      2. flip3-- N/A

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

      3. lower-/.f64 N/A

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

      4. lift-cbrt.f64 N/A

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

      5. rem-cube-cbrt N/A

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

      6. lift-cbrt.f64 N/A

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

      7. rem-cube-cbrt N/A

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

      8. lower--.f64 N/A

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

      9. lift-+.f64 N/A

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

      10. metadata-eval N/A

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

      11. fp-cancel-sign-sub-inv N/A

          \[\leadsto \frac{\color{blue}{\left(x - \left(\mathsf{neg}\left(1\right)\right) \cdot 1\right)} - x}{\sqrt[3]{x + 1} \cdot \sqrt[3]{x + 1} + \left(\sqrt[3]{x} \cdot \sqrt[3]{x} + \sqrt[3]{x + 1} \cdot \sqrt[3]{x}\right)} \]

      12. metadata-eval N/A

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

      13. metadata-eval N/A

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

      14. metadata-eval N/A

          \[\leadsto \frac{\left(x - \color{blue}{\left(\mathsf{neg}\left(1\right)\right)}\right) - x}{\sqrt[3]{x + 1} \cdot \sqrt[3]{x + 1} + \left(\sqrt[3]{x} \cdot \sqrt[3]{x} + \sqrt[3]{x + 1} \cdot \sqrt[3]{x}\right)} \]

      15. lower--.f64 N/A

          \[\leadsto \frac{\color{blue}{\left(x - \left(\mathsf{neg}\left(1\right)\right)\right)} - x}{\sqrt[3]{x + 1} \cdot \sqrt[3]{x + 1} + \left(\sqrt[3]{x} \cdot \sqrt[3]{x} + \sqrt[3]{x + 1} \cdot \sqrt[3]{x}\right)} \]

      16. metadata-eval N/A

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

      17. +-commutative N/A

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

   4. Applied rewrites 99.1%

      \[\leadsto \color{blue}{\frac{\left(x - -1\right) - x}{\mathsf{fma}\left(\sqrt[3]{x}, \sqrt[3]{x} + \sqrt[3]{x - -1}, {\left(\sqrt[3]{x - -1}\right)}^{2}\right)}} \]

   if 5e15 < x

   1. Initial program 4.2%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 54.5%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.3%

      \[\leadsto \frac{\sqrt[3]{\frac{-1}{x}}}{\sqrt[3]{-x}} \cdot 0.3333333333333333 \]
   8. Step-by-step derivation

   9. Applied rewrites 98.4%

      \[\leadsto \color{blue}{\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 97.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1.3 \cdot 10^{+72}:\\ \;\;\;\;\frac{\mathsf{fma}\left({x}^{-0.6666666666666666}, 0.06172839506172839, \mathsf{fma}\left(-0.1111111111111111, \sqrt[3]{x}, \sqrt[3]{{x}^{4}} \cdot 0.3333333333333333\right)\right)}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.3e+72)
   (/
    (fma
     (pow x -0.6666666666666666)
     0.06172839506172839
     (fma
      -0.1111111111111111
      (cbrt x)
      (* (cbrt (pow x 4.0)) 0.3333333333333333)))
    (* x x))
   (/ (/ -0.3333333333333333 (cbrt x)) (cbrt (- x)))))

C

double code(double x) {
	double tmp;
	if (x <= 1.3e+72) {
		tmp = fma(pow(x, -0.6666666666666666), 0.06172839506172839, fma(-0.1111111111111111, cbrt(x), (cbrt(pow(x, 4.0)) * 0.3333333333333333))) / (x * x);
	} else {
		tmp = (-0.3333333333333333 / cbrt(x)) / cbrt(-x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.3e+72)
		tmp = Float64(fma((x ^ -0.6666666666666666), 0.06172839506172839, fma(-0.1111111111111111, cbrt(x), Float64(cbrt((x ^ 4.0)) * 0.3333333333333333))) / Float64(x * x));
	else
		tmp = Float64(Float64(-0.3333333333333333 / cbrt(x)) / cbrt(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 1.3e+72], N[(N[(N[Power[x, -0.6666666666666666], $MachinePrecision] * 0.06172839506172839 + N[(-0.1111111111111111 * N[Power[x, 1/3], $MachinePrecision] + N[(N[Power[N[Power[x, 4.0], $MachinePrecision], 1/3], $MachinePrecision] * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(N[(-0.3333333333333333 / N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision] / N[Power[(-x), 1/3], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.29999999999999991e72

   1. Initial program 17.8%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{\frac{-1}{9} \cdot \sqrt[3]{x} + \left(\frac{5}{81} \cdot \sqrt[3]{\frac{1}{{x}^{2}}} + \frac{1}{3} \cdot \sqrt[3]{{x}^{4}}\right)}{{x}^{2}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 95.9%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt[3]{{x}^{4}}, 0.3333333333333333, \mathsf{fma}\left(\sqrt[3]{\frac{\frac{1}{x}}{x}}, 0.06172839506172839, -0.1111111111111111 \cdot \sqrt[3]{x}\right)\right)}{x \cdot x}} \]
   6. Step-by-step derivation

   7. Applied rewrites 95.9%

      \[\leadsto \frac{\mathsf{fma}\left(\sqrt[3]{{x}^{-2}}, 0.06172839506172839, \mathsf{fma}\left(-0.1111111111111111, \sqrt[3]{x}, \sqrt[3]{{x}^{4}} \cdot 0.3333333333333333\right)\right)}{\color{blue}{x} \cdot x} \]
   8. Step-by-step derivation

   9. Applied rewrites 95.9%

      \[\leadsto \frac{\mathsf{fma}\left({x}^{-0.6666666666666666}, 0.06172839506172839, \mathsf{fma}\left(-0.1111111111111111, \sqrt[3]{x}, \sqrt[3]{{x}^{4}} \cdot 0.3333333333333333\right)\right)}{x \cdot x} \]

   if 1.29999999999999991e72 < x

   1. Initial program 4.4%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 42.5%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.2%

      \[\leadsto \frac{\sqrt[3]{\frac{-1}{x}}}{\sqrt[3]{-x}} \cdot 0.3333333333333333 \]
   8. Step-by-step derivation

   9. Applied rewrites 98.4%

      \[\leadsto \color{blue}{\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 97.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 4.5 \cdot 10^{+154}:\\ \;\;\;\;\mathsf{fma}\left(\sqrt[3]{\frac{1}{{x}^{5}}}, -0.1111111111111111, \sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{\sqrt[3]{x}} \cdot 0.3333333333333333}{\sqrt[3]{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 4.5e+154)
   (fma
    (cbrt (/ 1.0 (pow x 5.0)))
    -0.1111111111111111
    (* (cbrt (/ (/ 1.0 x) x)) 0.3333333333333333))
   (/ (* (/ 1.0 (cbrt x)) 0.3333333333333333) (cbrt x))))

C

double code(double x) {
	double tmp;
	if (x <= 4.5e+154) {
		tmp = fma(cbrt((1.0 / pow(x, 5.0))), -0.1111111111111111, (cbrt(((1.0 / x) / x)) * 0.3333333333333333));
	} else {
		tmp = ((1.0 / cbrt(x)) * 0.3333333333333333) / cbrt(x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 4.5e+154)
		tmp = fma(cbrt(Float64(1.0 / (x ^ 5.0))), -0.1111111111111111, Float64(cbrt(Float64(Float64(1.0 / x) / x)) * 0.3333333333333333));
	else
		tmp = Float64(Float64(Float64(1.0 / cbrt(x)) * 0.3333333333333333) / cbrt(x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 4.5e+154], N[(N[Power[N[(1.0 / N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] * -0.1111111111111111 + N[(N[Power[N[(N[(1.0 / x), $MachinePrecision] / x), $MachinePrecision], 1/3], $MachinePrecision] * 0.3333333333333333), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision] * 0.3333333333333333), $MachinePrecision] / N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 4.50000000000000009e154

   1. Initial program 10.5%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{\frac{-1}{9} \cdot \sqrt[3]{x} + \left(\frac{5}{81} \cdot \sqrt[3]{\frac{1}{{x}^{2}}} + \frac{1}{3} \cdot \sqrt[3]{{x}^{4}}\right)}{{x}^{2}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 48.9%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt[3]{{x}^{4}}, 0.3333333333333333, \mathsf{fma}\left(\sqrt[3]{\frac{\frac{1}{x}}{x}}, 0.06172839506172839, -0.1111111111111111 \cdot \sqrt[3]{x}\right)\right)}{x \cdot x}} \]

   6. Taylor expanded in x around inf

      \[\leadsto \frac{-1}{9} \cdot \sqrt[3]{\frac{1}{{x}^{5}}} + \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
   7. Step-by-step derivation

   8. Applied rewrites 96.5%

      \[\leadsto \mathsf{fma}\left(\sqrt[3]{\frac{1}{{x}^{5}}}, \color{blue}{-0.1111111111111111}, \sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333\right) \]

   if 4.50000000000000009e154 < x

   1. Initial program 4.8%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 5.6%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.4%

      \[\leadsto \frac{\frac{1}{\sqrt[3]{x}} \cdot 0.3333333333333333}{\color{blue}{\sqrt[3]{x}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 97.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1.3 \cdot 10^{+72}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\sqrt[3]{x}, -0.1111111111111111, \sqrt[3]{{x}^{4}} \cdot 0.3333333333333333\right)}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.3e+72)
   (/
    (fma
     (cbrt x)
     -0.1111111111111111
     (* (cbrt (pow x 4.0)) 0.3333333333333333))
    (* x x))
   (/ (/ -0.3333333333333333 (cbrt x)) (cbrt (- x)))))

C

double code(double x) {
	double tmp;
	if (x <= 1.3e+72) {
		tmp = fma(cbrt(x), -0.1111111111111111, (cbrt(pow(x, 4.0)) * 0.3333333333333333)) / (x * x);
	} else {
		tmp = (-0.3333333333333333 / cbrt(x)) / cbrt(-x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.3e+72)
		tmp = Float64(fma(cbrt(x), -0.1111111111111111, Float64(cbrt((x ^ 4.0)) * 0.3333333333333333)) / Float64(x * x));
	else
		tmp = Float64(Float64(-0.3333333333333333 / cbrt(x)) / cbrt(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 1.3e+72], N[(N[(N[Power[x, 1/3], $MachinePrecision] * -0.1111111111111111 + N[(N[Power[N[Power[x, 4.0], $MachinePrecision], 1/3], $MachinePrecision] * 0.3333333333333333), $MachinePrecision]), $MachinePrecision] / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(N[(-0.3333333333333333 / N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision] / N[Power[(-x), 1/3], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.29999999999999991e72

   1. Initial program 17.8%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 88.6%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]

   6. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{\frac{-1}{9} \cdot \sqrt[3]{x} + \frac{1}{3} \cdot \sqrt[3]{{x}^{4}}}{{x}^{2}}} \]
   7. Step-by-step derivation

   8. Applied rewrites 94.3%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt[3]{{x}^{4}}, 0.3333333333333333, -0.1111111111111111 \cdot \sqrt[3]{x}\right)}{x \cdot x}} \]
   9. Step-by-step derivation

   10. Applied rewrites 94.3%

       \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt[3]{x}, -0.1111111111111111, \sqrt[3]{{x}^{4}} \cdot 0.3333333333333333\right)}{x \cdot x}} \]

   if 1.29999999999999991e72 < x

   1. Initial program 4.4%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 42.5%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.2%

      \[\leadsto \frac{\sqrt[3]{\frac{-1}{x}}}{\sqrt[3]{-x}} \cdot 0.3333333333333333 \]
   8. Step-by-step derivation

   9. Applied rewrites 98.4%

      \[\leadsto \color{blue}{\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 97.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1.3 \cdot 10^{+72}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\sqrt[3]{{x}^{4}}, 0.3333333333333333, -0.1111111111111111 \cdot \sqrt[3]{x}\right)}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.3e+72)
   (/
    (fma
     (cbrt (pow x 4.0))
     0.3333333333333333
     (* -0.1111111111111111 (cbrt x)))
    (* x x))
   (/ (/ -0.3333333333333333 (cbrt x)) (cbrt (- x)))))

C

double code(double x) {
	double tmp;
	if (x <= 1.3e+72) {
		tmp = fma(cbrt(pow(x, 4.0)), 0.3333333333333333, (-0.1111111111111111 * cbrt(x))) / (x * x);
	} else {
		tmp = (-0.3333333333333333 / cbrt(x)) / cbrt(-x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.3e+72)
		tmp = Float64(fma(cbrt((x ^ 4.0)), 0.3333333333333333, Float64(-0.1111111111111111 * cbrt(x))) / Float64(x * x));
	else
		tmp = Float64(Float64(-0.3333333333333333 / cbrt(x)) / cbrt(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 1.3e+72], N[(N[(N[Power[N[Power[x, 4.0], $MachinePrecision], 1/3], $MachinePrecision] * 0.3333333333333333 + N[(-0.1111111111111111 * N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(N[(-0.3333333333333333 / N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision] / N[Power[(-x), 1/3], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.29999999999999991e72

   1. Initial program 17.8%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{\frac{-1}{9} \cdot \sqrt[3]{x} + \frac{1}{3} \cdot \sqrt[3]{{x}^{4}}}{{x}^{2}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 94.3%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt[3]{{x}^{4}}, 0.3333333333333333, -0.1111111111111111 \cdot \sqrt[3]{x}\right)}{x \cdot x}} \]

   if 1.29999999999999991e72 < x

   1. Initial program 4.4%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 42.5%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.2%

      \[\leadsto \frac{\sqrt[3]{\frac{-1}{x}}}{\sqrt[3]{-x}} \cdot 0.3333333333333333 \]
   8. Step-by-step derivation

   9. Applied rewrites 98.4%

      \[\leadsto \color{blue}{\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 97.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 2 \cdot 10^{+153}:\\ \;\;\;\;\frac{\mathsf{fma}\left({x}^{-1.6666666666666667}, -0.1111111111111111, \sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333\right) \cdot \left(x \cdot x\right)}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{\sqrt[3]{x}} \cdot 0.3333333333333333}{\sqrt[3]{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 2e+153)
   (/
    (*
     (fma
      (pow x -1.6666666666666667)
      -0.1111111111111111
      (* (cbrt (/ (/ 1.0 x) x)) 0.3333333333333333))
     (* x x))
    (* x x))
   (/ (* (/ 1.0 (cbrt x)) 0.3333333333333333) (cbrt x))))

C

double code(double x) {
	double tmp;
	if (x <= 2e+153) {
		tmp = (fma(pow(x, -1.6666666666666667), -0.1111111111111111, (cbrt(((1.0 / x) / x)) * 0.3333333333333333)) * (x * x)) / (x * x);
	} else {
		tmp = ((1.0 / cbrt(x)) * 0.3333333333333333) / cbrt(x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 2e+153)
		tmp = Float64(Float64(fma((x ^ -1.6666666666666667), -0.1111111111111111, Float64(cbrt(Float64(Float64(1.0 / x) / x)) * 0.3333333333333333)) * Float64(x * x)) / Float64(x * x));
	else
		tmp = Float64(Float64(Float64(1.0 / cbrt(x)) * 0.3333333333333333) / cbrt(x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 2e+153], N[(N[(N[(N[Power[x, -1.6666666666666667], $MachinePrecision] * -0.1111111111111111 + N[(N[Power[N[(N[(1.0 / x), $MachinePrecision] / x), $MachinePrecision], 1/3], $MachinePrecision] * 0.3333333333333333), $MachinePrecision]), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision] / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision] * 0.3333333333333333), $MachinePrecision] / N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 2e153

   1. Initial program 10.6%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 93.8%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]

   6. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{\frac{-1}{9} \cdot \sqrt[3]{x} + \frac{1}{3} \cdot \sqrt[3]{{x}^{4}}}{{x}^{2}}} \]
   7. Step-by-step derivation

   8. Applied rewrites 48.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt[3]{{x}^{4}}, 0.3333333333333333, -0.1111111111111111 \cdot \sqrt[3]{x}\right)}{x \cdot x}} \]

   9. Taylor expanded in x around inf

      \[\leadsto \frac{{x}^{2} \cdot \left(\frac{-1}{9} \cdot \sqrt[3]{\frac{1}{{x}^{5}}} + \frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}\right)}{\color{blue}{x} \cdot x} \]
   10. Step-by-step derivation

   11. Applied rewrites 96.4%

       \[\leadsto \frac{\mathsf{fma}\left(\sqrt[3]{\frac{1}{{x}^{5}}}, -0.1111111111111111, \sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333\right) \cdot \left(x \cdot x\right)}{\color{blue}{x} \cdot x} \]
   12. Step-by-step derivation

   13. Applied rewrites 96.4%

       \[\leadsto \frac{\mathsf{fma}\left({x}^{-1.6666666666666667}, -0.1111111111111111, \sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333\right) \cdot \left(x \cdot x\right)}{x \cdot x} \]

   if 2e153 < x

   1. Initial program 4.8%

      \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 6.4%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.4%

      \[\leadsto \frac{\frac{1}{\sqrt[3]{x}} \cdot 0.3333333333333333}{\color{blue}{\sqrt[3]{x}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 96.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/ (/ -0.3333333333333333 (cbrt x)) (cbrt (- x))))

C

double code(double x) {
	return (-0.3333333333333333 / cbrt(x)) / cbrt(-x);
}

Java

public static double code(double x) {
	return (-0.3333333333333333 / Math.cbrt(x)) / Math.cbrt(-x);
}

Julia

function code(x)
	return Float64(Float64(-0.3333333333333333 / cbrt(x)) / cbrt(Float64(-x)))
end

Wolfram

code[x_] := N[(N[(-0.3333333333333333 / N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision] / N[Power[(-x), 1/3], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 8.0%

   \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
4. Step-by-step derivation

5. Applied rewrites 54.9%

   \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
6. Step-by-step derivation

7. Applied rewrites 95.6%

   \[\leadsto \frac{\sqrt[3]{\frac{-1}{x}}}{\sqrt[3]{-x}} \cdot 0.3333333333333333 \]
8. Step-by-step derivation

9. Applied rewrites 95.6%

   \[\leadsto \color{blue}{\frac{\frac{-0.3333333333333333}{\sqrt[3]{x}}}{\sqrt[3]{-x}}} \]
10. Add Preprocessing

Alternative 9: 96.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \frac{1}{{\left(\sqrt[3]{x}\right)}^{2}} \cdot 0.3333333333333333 \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (* (/ 1.0 (pow (cbrt x) 2.0)) 0.3333333333333333))

C

double code(double x) {
	return (1.0 / pow(cbrt(x), 2.0)) * 0.3333333333333333;
}

Java

public static double code(double x) {
	return (1.0 / Math.pow(Math.cbrt(x), 2.0)) * 0.3333333333333333;
}

Julia

function code(x)
	return Float64(Float64(1.0 / (cbrt(x) ^ 2.0)) * 0.3333333333333333)
end

Wolfram

code[x_] := N[(N[(1.0 / N[Power[N[Power[x, 1/3], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * 0.3333333333333333), $MachinePrecision]

Derivation

1. Initial program 8.0%

   \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
4. Step-by-step derivation

5. Applied rewrites 54.9%

   \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
6. Step-by-step derivation

7. Applied rewrites 95.6%

   \[\leadsto \frac{1}{{\left(\sqrt[3]{x}\right)}^{2}} \cdot 0.3333333333333333 \]
8. Add Preprocessing

Alternative 10: 49.7% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333 \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (cbrt (/ (/ 1.0 x) x)) 0.3333333333333333))

C

double code(double x) {
	return cbrt(((1.0 / x) / x)) * 0.3333333333333333;
}

Java

public static double code(double x) {
	return Math.cbrt(((1.0 / x) / x)) * 0.3333333333333333;
}

Julia

function code(x)
	return Float64(cbrt(Float64(Float64(1.0 / x) / x)) * 0.3333333333333333)
end

Wolfram

code[x_] := N[(N[Power[N[(N[(1.0 / x), $MachinePrecision] / x), $MachinePrecision], 1/3], $MachinePrecision] * 0.3333333333333333), $MachinePrecision]

Derivation

1. Initial program 8.0%

   \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
4. Step-by-step derivation

5. Applied rewrites 54.9%

   \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
6. Add Preprocessing

Alternative 11: 48.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \sqrt[3]{\frac{1}{x \cdot x}} \cdot 0.3333333333333333 \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (cbrt (/ 1.0 (* x x))) 0.3333333333333333))

C

double code(double x) {
	return cbrt((1.0 / (x * x))) * 0.3333333333333333;
}

Java

public static double code(double x) {
	return Math.cbrt((1.0 / (x * x))) * 0.3333333333333333;
}

Julia

function code(x)
	return Float64(cbrt(Float64(1.0 / Float64(x * x))) * 0.3333333333333333)
end

Wolfram

code[x_] := N[(N[Power[N[(1.0 / N[(x * x), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] * 0.3333333333333333), $MachinePrecision]

Derivation

1. Initial program 8.0%

   \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
4. Step-by-step derivation

5. Applied rewrites 54.9%

   \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]
6. Step-by-step derivation

7. Applied rewrites 54.1%

   \[\leadsto \sqrt[3]{\frac{1}{x \cdot x}} \cdot 0.3333333333333333 \]
8. Add Preprocessing

Alternative 12: 4.2% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(0.3333333333333333, x, 1 - \sqrt[3]{x}\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (fma 0.3333333333333333 x (- 1.0 (cbrt x))))

C

double code(double x) {
	return fma(0.3333333333333333, x, (1.0 - cbrt(x)));
}

Julia

function code(x)
	return fma(0.3333333333333333, x, Float64(1.0 - cbrt(x)))
end

Wolfram

code[x_] := N[(0.3333333333333333 * x + N[(1.0 - N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 8.0%

   \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Applied rewrites 4.5%

   \[\leadsto \color{blue}{\mathsf{fma}\left(0.3333333333333333, x, 1 - \sqrt[3]{x}\right)} \]
6. Add Preprocessing

Alternative 13: 4.1% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(0.3333333333333333, x, -\sqrt[3]{x}\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (fma 0.3333333333333333 x (- (cbrt x))))

C

double code(double x) {
	return fma(0.3333333333333333, x, -cbrt(x));
}

Julia

function code(x)
	return fma(0.3333333333333333, x, Float64(-cbrt(x)))
end

Wolfram

code[x_] := N[(0.3333333333333333 * x + (-N[Power[x, 1/3], $MachinePrecision])), $MachinePrecision]

Derivation

1. Initial program 8.0%

   \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt[3]{\frac{1}{{x}^{2}}}} \]
4. Step-by-step derivation

5. Applied rewrites 54.9%

   \[\leadsto \color{blue}{\sqrt[3]{\frac{\frac{1}{x}}{x}} \cdot 0.3333333333333333} \]

6. Taylor expanded in x around 0

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

8. Applied rewrites 4.5%

   \[\leadsto \color{blue}{\mathsf{fma}\left(0.3333333333333333, x, 1 - \sqrt[3]{x}\right)} \]

9. Taylor expanded in x around inf

   \[\leadsto \mathsf{fma}\left(\frac{1}{3}, x, -1 \cdot \sqrt[3]{x}\right) \]
10. Step-by-step derivation

11. Applied rewrites 4.4%

    \[\leadsto \mathsf{fma}\left(0.3333333333333333, x, -\sqrt[3]{x}\right) \]
12. Add Preprocessing

Alternative 14: 4.2% accurate, 34.5× speedup

Math

\[\begin{array}{l} \\ 0 \cdot x \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* 0.0 x))

C

double code(double x) {
	return 0.0 * x;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = 0.0d0 * x
end function

Java

public static double code(double x) {
	return 0.0 * x;
}

Python

def code(x):
	return 0.0 * x

Julia

function code(x)
	return Float64(0.0 * x)
end

MATLAB

function tmp = code(x)
	tmp = 0.0 * x;
end

Wolfram

code[x_] := N[(0.0 * x), $MachinePrecision]

Derivation

1. Initial program 8.0%

   \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-cbrt.f64 N/A

      \[\leadsto \color{blue}{\sqrt[3]{x + 1}} - \sqrt[3]{x} \]

   2. pow1/3 N/A

      \[\leadsto \color{blue}{{\left(x + 1\right)}^{\frac{1}{3}}} - \sqrt[3]{x} \]

   3. lower-pow.f64 5.7

      \[\leadsto \color{blue}{{\left(x + 1\right)}^{0.3333333333333333}} - \sqrt[3]{x} \]

   4. lift-+.f64 N/A

      \[\leadsto {\color{blue}{\left(x + 1\right)}}^{\frac{1}{3}} - \sqrt[3]{x} \]

   5. metadata-eval N/A

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

   6. fp-cancel-sign-sub-inv N/A

      \[\leadsto {\color{blue}{\left(x - \left(\mathsf{neg}\left(1\right)\right) \cdot 1\right)}}^{\frac{1}{3}} - \sqrt[3]{x} \]

   7. metadata-eval N/A

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

   8. metadata-eval N/A

      \[\leadsto {\left(x - \color{blue}{-1}\right)}^{\frac{1}{3}} - \sqrt[3]{x} \]

   9. metadata-eval N/A

      \[\leadsto {\left(x - \color{blue}{\left(\mathsf{neg}\left(1\right)\right)}\right)}^{\frac{1}{3}} - \sqrt[3]{x} \]

   10. lower--.f64 N/A

       \[\leadsto {\color{blue}{\left(x - \left(\mathsf{neg}\left(1\right)\right)\right)}}^{\frac{1}{3}} - \sqrt[3]{x} \]

   11. metadata-eval 5.7

       \[\leadsto {\left(x - \color{blue}{-1}\right)}^{0.3333333333333333} - \sqrt[3]{x} \]

4. Applied rewrites 5.7%

   \[\leadsto \color{blue}{{\left(x - -1\right)}^{0.3333333333333333}} - \sqrt[3]{x} \]
5. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{{\left(x - -1\right)}^{\frac{1}{3}} - \sqrt[3]{x}} \]

   2. lift-pow.f64 N/A

      \[\leadsto \color{blue}{{\left(x - -1\right)}^{\frac{1}{3}}} - \sqrt[3]{x} \]

   3. unpow1/3 N/A

      \[\leadsto \color{blue}{\sqrt[3]{x - -1}} - \sqrt[3]{x} \]

   4. lift--.f64 N/A

      \[\leadsto \sqrt[3]{\color{blue}{x - -1}} - \sqrt[3]{x} \]

   5. metadata-eval N/A

      \[\leadsto \sqrt[3]{x - \color{blue}{1 \cdot -1}} - \sqrt[3]{x} \]

   6. fp-cancel-sub-sign N/A

      \[\leadsto \sqrt[3]{\color{blue}{x + \left(\mathsf{neg}\left(1\right)\right) \cdot -1}} - \sqrt[3]{x} \]

   7. metadata-eval N/A

      \[\leadsto \sqrt[3]{x + \color{blue}{-1} \cdot -1} - \sqrt[3]{x} \]

   8. metadata-eval N/A

      \[\leadsto \sqrt[3]{x + \color{blue}{1}} - \sqrt[3]{x} \]

   9. lift-cbrt.f64 N/A

      \[\leadsto \sqrt[3]{x + 1} - \color{blue}{\sqrt[3]{x}} \]

   10. lift-+.f64 N/A

       \[\leadsto \sqrt[3]{\color{blue}{x + 1}} - \sqrt[3]{x} \]

   11. lift-cbrt.f64 N/A

       \[\leadsto \color{blue}{\sqrt[3]{x + 1}} - \sqrt[3]{x} \]

   12. pow1/3 N/A

       \[\leadsto \sqrt[3]{x + 1} - \color{blue}{{x}^{\frac{1}{3}}} \]

   13. metadata-eval N/A

       \[\leadsto \sqrt[3]{x + 1} - {x}^{\color{blue}{\left(\frac{1}{6} + \frac{1}{6}\right)}} \]

   14. pow-prod-up N/A

       \[\leadsto \sqrt[3]{x + 1} - \color{blue}{{x}^{\frac{1}{6}} \cdot {x}^{\frac{1}{6}}} \]

   15. lift-pow.f64 N/A

       \[\leadsto \sqrt[3]{x + 1} - \color{blue}{{x}^{\frac{1}{6}}} \cdot {x}^{\frac{1}{6}} \]

   16. lift-pow.f64 N/A

       \[\leadsto \sqrt[3]{x + 1} - {x}^{\frac{1}{6}} \cdot \color{blue}{{x}^{\frac{1}{6}}} \]

   17. fp-cancel-sub-sign-inv N/A

       \[\leadsto \color{blue}{\sqrt[3]{x + 1} + \left(\mathsf{neg}\left({x}^{\frac{1}{6}}\right)\right) \cdot {x}^{\frac{1}{6}}} \]

   18. +-commutative N/A

       \[\leadsto \color{blue}{\left(\mathsf{neg}\left({x}^{\frac{1}{6}}\right)\right) \cdot {x}^{\frac{1}{6}} + \sqrt[3]{x + 1}} \]

   19. *-commutative N/A

       \[\leadsto \color{blue}{{x}^{\frac{1}{6}} \cdot \left(\mathsf{neg}\left({x}^{\frac{1}{6}}\right)\right)} + \sqrt[3]{x + 1} \]

   20. lower-fma.f64 N/A

       \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{\frac{1}{6}}, \mathsf{neg}\left({x}^{\frac{1}{6}}\right), \sqrt[3]{x + 1}\right)} \]

   21. lower-neg.f64 9.2

       \[\leadsto \mathsf{fma}\left({x}^{0.16666666666666666}, \color{blue}{-{x}^{0.16666666666666666}}, \sqrt[3]{x + 1}\right) \]

   22. lift-+.f64 N/A

       \[\leadsto \mathsf{fma}\left({x}^{\frac{1}{6}}, -{x}^{\frac{1}{6}}, \sqrt[3]{\color{blue}{x + 1}}\right) \]

   23. metadata-eval N/A

       \[\leadsto \mathsf{fma}\left({x}^{\frac{1}{6}}, -{x}^{\frac{1}{6}}, \sqrt[3]{x + \color{blue}{-1 \cdot -1}}\right) \]

   24. metadata-eval N/A

       \[\leadsto \mathsf{fma}\left({x}^{\frac{1}{6}}, -{x}^{\frac{1}{6}}, \sqrt[3]{x + \color{blue}{\left(\mathsf{neg}\left(1\right)\right)} \cdot -1}\right) \]

6. Applied rewrites 9.2%

   \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{0.16666666666666666}, -{x}^{0.16666666666666666}, \sqrt[3]{x - -1}\right)} \]

7. Taylor expanded in x around inf

   \[\leadsto \color{blue}{x \cdot \left(\sqrt[3]{\frac{1}{{x}^{2}}} + -1 \cdot \sqrt[3]{\frac{1}{{x}^{2}}}\right)} \]
8. Step-by-step derivation

9. Applied rewrites 4.1%

   \[\leadsto \color{blue}{0 \cdot x} \]
10. Add Preprocessing

Developer Target 1: 98.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt[3]{x + 1}\\ \frac{1}{\left(t\_0 \cdot t\_0 + \sqrt[3]{x} \cdot t\_0\right) + \sqrt[3]{x} \cdot \sqrt[3]{x}} \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (cbrt (+ x 1.0))))
   (/ 1.0 (+ (+ (* t_0 t_0) (* (cbrt x) t_0)) (* (cbrt x) (cbrt x))))))

C

double code(double x) {
	double t_0 = cbrt((x + 1.0));
	return 1.0 / (((t_0 * t_0) + (cbrt(x) * t_0)) + (cbrt(x) * cbrt(x)));
}

Java

public static double code(double x) {
	double t_0 = Math.cbrt((x + 1.0));
	return 1.0 / (((t_0 * t_0) + (Math.cbrt(x) * t_0)) + (Math.cbrt(x) * Math.cbrt(x)));
}

Julia

function code(x)
	t_0 = cbrt(Float64(x + 1.0))
	return Float64(1.0 / Float64(Float64(Float64(t_0 * t_0) + Float64(cbrt(x) * t_0)) + Float64(cbrt(x) * cbrt(x))))
end

Wolfram

code[x_] := Block[{t$95$0 = N[Power[N[(x + 1.0), $MachinePrecision], 1/3], $MachinePrecision]}, N[(1.0 / N[(N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[Power[x, 1/3], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] + N[(N[Power[x, 1/3], $MachinePrecision] * N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2025019 
(FPCore (x)
  :name "2cbrt (problem 3.3.4)"
  :precision binary64
  :pre (and (> x 1.0) (< x 1e+308))

  :alt
  (! :herbie-platform default (/ 1 (+ (* (cbrt (+ x 1)) (cbrt (+ x 1))) (* (cbrt x) (cbrt (+ x 1))) (* (cbrt x) (cbrt x)))))

  (- (cbrt (+ x 1.0)) (cbrt x)))