2-ancestry mixing, positive discriminant

Percentage Accurate: 44.4% → 95.7%

Time: 15.5s

Alternatives: 4

Speedup: 2.6×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{2 \cdot a}\\ t_1 := \sqrt{g \cdot g - h \cdot h}\\ \sqrt[3]{t\_0 \cdot \left(\left(-g\right) + t\_1\right)} + \sqrt[3]{t\_0 \cdot \left(\left(-g\right) - t\_1\right)} \end{array} \end{array} \]

FPCore

(FPCore (g h a)
 :precision binary64
 (let* ((t_0 (/ 1.0 (* 2.0 a))) (t_1 (sqrt (- (* g g) (* h h)))))
   (+ (cbrt (* t_0 (+ (- g) t_1))) (cbrt (* t_0 (- (- g) t_1))))))

C

double code(double g, double h, double a) {
	double t_0 = 1.0 / (2.0 * a);
	double t_1 = sqrt(((g * g) - (h * h)));
	return cbrt((t_0 * (-g + t_1))) + cbrt((t_0 * (-g - t_1)));
}

Java

public static double code(double g, double h, double a) {
	double t_0 = 1.0 / (2.0 * a);
	double t_1 = Math.sqrt(((g * g) - (h * h)));
	return Math.cbrt((t_0 * (-g + t_1))) + Math.cbrt((t_0 * (-g - t_1)));
}

Julia

function code(g, h, a)
	t_0 = Float64(1.0 / Float64(2.0 * a))
	t_1 = sqrt(Float64(Float64(g * g) - Float64(h * h)))
	return Float64(cbrt(Float64(t_0 * Float64(Float64(-g) + t_1))) + cbrt(Float64(t_0 * Float64(Float64(-g) - t_1))))
end

Wolfram

code[g_, h_, a_] := Block[{t$95$0 = N[(1.0 / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(g * g), $MachinePrecision] - N[(h * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, N[(N[Power[N[(t$95$0 * N[((-g) + t$95$1), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] + N[Power[N[(t$95$0 * N[((-g) - t$95$1), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]]]

Initial Program: 44.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{2 \cdot a}\\ t_1 := \sqrt{g \cdot g - h \cdot h}\\ \sqrt[3]{t\_0 \cdot \left(\left(-g\right) + t\_1\right)} + \sqrt[3]{t\_0 \cdot \left(\left(-g\right) - t\_1\right)} \end{array} \end{array} \]

FPCore

(FPCore (g h a)
 :precision binary64
 (let* ((t_0 (/ 1.0 (* 2.0 a))) (t_1 (sqrt (- (* g g) (* h h)))))
   (+ (cbrt (* t_0 (+ (- g) t_1))) (cbrt (* t_0 (- (- g) t_1))))))

C

double code(double g, double h, double a) {
	double t_0 = 1.0 / (2.0 * a);
	double t_1 = sqrt(((g * g) - (h * h)));
	return cbrt((t_0 * (-g + t_1))) + cbrt((t_0 * (-g - t_1)));
}

Java

public static double code(double g, double h, double a) {
	double t_0 = 1.0 / (2.0 * a);
	double t_1 = Math.sqrt(((g * g) - (h * h)));
	return Math.cbrt((t_0 * (-g + t_1))) + Math.cbrt((t_0 * (-g - t_1)));
}

Julia

function code(g, h, a)
	t_0 = Float64(1.0 / Float64(2.0 * a))
	t_1 = sqrt(Float64(Float64(g * g) - Float64(h * h)))
	return Float64(cbrt(Float64(t_0 * Float64(Float64(-g) + t_1))) + cbrt(Float64(t_0 * Float64(Float64(-g) - t_1))))
end

Wolfram

code[g_, h_, a_] := Block[{t$95$0 = N[(1.0 / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(g * g), $MachinePrecision] - N[(h * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, N[(N[Power[N[(t$95$0 * N[((-g) + t$95$1), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] + N[Power[N[(t$95$0 * N[((-g) - t$95$1), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]]]

Alternative 1: 95.7% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (g h a) :precision binary64 (* (cbrt (/ g -2.0)) (cbrt (/ 2.0 a))))

C

double code(double g, double h, double a) {
	return cbrt((g / -2.0)) * cbrt((2.0 / a));
}

Java

public static double code(double g, double h, double a) {
	return Math.cbrt((g / -2.0)) * Math.cbrt((2.0 / a));
}

Julia

function code(g, h, a)
	return Float64(cbrt(Float64(g / -2.0)) * cbrt(Float64(2.0 / a)))
end

Wolfram

code[g_, h_, a_] := N[(N[Power[N[(g / -2.0), $MachinePrecision], 1/3], $MachinePrecision] * N[Power[N[(2.0 / a), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 43.4%

   \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]
2. Add Preprocessing

4. Applied rewrites 48.1%

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

5. Taylor expanded in g around inf

   \[\leadsto \color{blue}{\sqrt[3]{\frac{g}{a}} \cdot \frac{\sqrt[3]{2}}{\sqrt[3]{-2}}} \]
6. Step-by-step derivation

   1. associate-*r/ N/A

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

   2. lower-/.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-cbrt.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-cbrt.f64 N/A

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

   7. lower-cbrt.f64 73.5

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

7. Applied rewrites 73.5%

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

9. Applied rewrites 96.8%

   \[\leadsto \frac{\frac{\sqrt[3]{g}}{\sqrt[3]{a}} \cdot \sqrt[3]{2}}{\sqrt[3]{-2}} \]
10. Step-by-step derivation

11. Applied rewrites 96.9%

    \[\leadsto \sqrt[3]{\frac{g}{-2}} \cdot \color{blue}{\sqrt[3]{\frac{2}{a}}} \]
12. Add Preprocessing

Alternative 2: 95.7% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (g h a) :precision binary64 (/ (cbrt (- g)) (cbrt a)))

C

double code(double g, double h, double a) {
	return cbrt(-g) / cbrt(a);
}

Java

public static double code(double g, double h, double a) {
	return Math.cbrt(-g) / Math.cbrt(a);
}

Julia

function code(g, h, a)
	return Float64(cbrt(Float64(-g)) / cbrt(a))
end

Wolfram

code[g_, h_, a_] := N[(N[Power[(-g), 1/3], $MachinePrecision] / N[Power[a, 1/3], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 43.4%

   \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]
2. Add Preprocessing

4. Applied rewrites 48.1%

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

5. Taylor expanded in g around inf

   \[\leadsto \color{blue}{\sqrt[3]{\frac{g}{a}} \cdot \frac{\sqrt[3]{2}}{\sqrt[3]{-2}}} \]
6. Step-by-step derivation

   1. associate-*r/ N/A

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

   2. lower-/.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-cbrt.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-cbrt.f64 N/A

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

   7. lower-cbrt.f64 73.5

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

7. Applied rewrites 73.5%

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

9. Applied rewrites 96.8%

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

Alternative 3: 73.9% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\sqrt[3]{a \cdot \frac{-1}{g}}} \end{array} \]

FPCore

(FPCore (g h a) :precision binary64 (/ 1.0 (cbrt (* a (/ -1.0 g)))))

C

double code(double g, double h, double a) {
	return 1.0 / cbrt((a * (-1.0 / g)));
}

Java

public static double code(double g, double h, double a) {
	return 1.0 / Math.cbrt((a * (-1.0 / g)));
}

Julia

function code(g, h, a)
	return Float64(1.0 / cbrt(Float64(a * Float64(-1.0 / g))))
end

Wolfram

code[g_, h_, a_] := N[(1.0 / N[Power[N[(a * N[(-1.0 / g), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 43.4%

   \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]
2. Add Preprocessing

4. Applied rewrites 48.1%

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

5. Taylor expanded in g around inf

   \[\leadsto \color{blue}{\sqrt[3]{\frac{g}{a}} \cdot \frac{\sqrt[3]{2}}{\sqrt[3]{-2}}} \]
6. Step-by-step derivation

   1. associate-*r/ N/A

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

   2. lower-/.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-cbrt.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-cbrt.f64 N/A

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

   7. lower-cbrt.f64 73.5

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

7. Applied rewrites 73.5%

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

9. Applied rewrites 96.8%

   \[\leadsto \frac{\frac{\sqrt[3]{g}}{\sqrt[3]{a}} \cdot \sqrt[3]{2}}{\sqrt[3]{-2}} \]
10. Step-by-step derivation

11. Applied rewrites 75.8%

    \[\leadsto \frac{1}{\color{blue}{\sqrt[3]{a \cdot \frac{-1}{g}}}} \]
12. Add Preprocessing

Alternative 4: 73.5% accurate, 2.6× speedup

Math

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

FPCore

(FPCore (g h a) :precision binary64 (cbrt (/ g (- a))))

C

double code(double g, double h, double a) {
	return cbrt((g / -a));
}

Java

public static double code(double g, double h, double a) {
	return Math.cbrt((g / -a));
}

Julia

function code(g, h, a)
	return cbrt(Float64(g / Float64(-a)))
end

Wolfram

code[g_, h_, a_] := N[Power[N[(g / (-a)), $MachinePrecision], 1/3], $MachinePrecision]

Derivation

1. Initial program 43.4%

   \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]
2. Add Preprocessing

4. Applied rewrites 48.1%

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

5. Taylor expanded in g around inf

   \[\leadsto \color{blue}{\sqrt[3]{\frac{g}{a}} \cdot \frac{\sqrt[3]{2}}{\sqrt[3]{-2}}} \]
6. Step-by-step derivation

   1. associate-*r/ N/A

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

   2. lower-/.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-cbrt.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-cbrt.f64 N/A

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

   7. lower-cbrt.f64 73.5

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

7. Applied rewrites 73.5%

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

9. Applied rewrites 73.2%

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

10. Taylor expanded in g around 0

    \[\leadsto \sqrt[3]{-1 \cdot \frac{g}{a}} \]
11. Step-by-step derivation

12. Applied rewrites 73.6%

    \[\leadsto \sqrt[3]{\frac{-g}{a}} \]

13. Final simplification 73.6%

    \[\leadsto \sqrt[3]{\frac{g}{-a}} \]
14. Add Preprocessing

Reproduce

herbie shell --seed 2024233 
(FPCore (g h a)
  :name "2-ancestry mixing, positive discriminant"
  :precision binary64
  (+ (cbrt (* (/ 1.0 (* 2.0 a)) (+ (- g) (sqrt (- (* g g) (* h h)))))) (cbrt (* (/ 1.0 (* 2.0 a)) (- (- g) (sqrt (- (* g g) (* h h))))))))