Data.Number.Erf:$cinvnormcdf from erf-2.0.0.0, A

Percentage Accurate: 99.4% → 99.4%

Time: 11.0s

Alternatives: 12

Speedup: 1.0×

• 44.8% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (* (* (- (* x 0.5) y) (sqrt (* z 2.0))) (exp (/ (* t t) 2.0))))

C

double code(double x, double y, double z, double t) {
	return (((x * 0.5) - y) * sqrt((z * 2.0))) * exp(((t * t) / 2.0));
}

Fortran

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

Java

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

Python

def code(x, y, z, t):
	return (((x * 0.5) - y) * math.sqrt((z * 2.0))) * math.exp(((t * t) / 2.0))

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(z * 2.0))) * exp(Float64(Float64(t * t) / 2.0)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((x * 0.5) - y) * sqrt((z * 2.0))) * exp(((t * t) / 2.0));
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Exp[N[(N[(t * t), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (* (* (- (* x 0.5) y) (sqrt (* z 2.0))) (exp (/ (* t t) 2.0))))

C

double code(double x, double y, double z, double t) {
	return (((x * 0.5) - y) * sqrt((z * 2.0))) * exp(((t * t) / 2.0));
}

Fortran

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

Java

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

Python

def code(x, y, z, t):
	return (((x * 0.5) - y) * math.sqrt((z * 2.0))) * math.exp(((t * t) / 2.0))

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(z * 2.0))) * exp(Float64(Float64(t * t) / 2.0)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((x * 0.5) - y) * sqrt((z * 2.0))) * exp(((t * t) / 2.0));
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Exp[N[(N[(t * t), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{\left(t \cdot t\right) \cdot 0.5} \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right) \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (* (exp (* (* t t) 0.5)) (* (sqrt (* 2.0 z)) (- (* 0.5 x) y))))

C

double code(double x, double y, double z, double t) {
	return exp(((t * t) * 0.5)) * (sqrt((2.0 * z)) * ((0.5 * x) - y));
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = exp(((t * t) * 0.5d0)) * (sqrt((2.0d0 * z)) * ((0.5d0 * x) - y))
end function

Java

public static double code(double x, double y, double z, double t) {
	return Math.exp(((t * t) * 0.5)) * (Math.sqrt((2.0 * z)) * ((0.5 * x) - y));
}

Python

def code(x, y, z, t):
	return math.exp(((t * t) * 0.5)) * (math.sqrt((2.0 * z)) * ((0.5 * x) - y))

Julia

function code(x, y, z, t)
	return Float64(exp(Float64(Float64(t * t) * 0.5)) * Float64(sqrt(Float64(2.0 * z)) * Float64(Float64(0.5 * x) - y)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = exp(((t * t) * 0.5)) * (sqrt((2.0 * z)) * ((0.5 * x) - y));
end

Wolfram

code[x_, y_, z_, t_] := N[(N[Exp[N[(N[(t * t), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision] * N[(N[(0.5 * x), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

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

   2. div-inv N/A

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

   3. metadata-eval N/A

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

   4. lower-*.f64 99.8

      \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\color{blue}{\left(t \cdot t\right) \cdot 0.5}} \]

4. Applied rewrites 99.8%

   \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\color{blue}{\left(t \cdot t\right) \cdot 0.5}} \]

5. Final simplification 99.8%

   \[\leadsto e^{\left(t \cdot t\right) \cdot 0.5} \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right) \]
6. Add Preprocessing

Alternative 2: 97.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 0.5 \cdot x - y\\ t_2 := \sqrt{2 \cdot z}\\ \mathbf{if}\;t \cdot t \leq 2 \cdot 10^{-8}:\\ \;\;\;\;1 \cdot \left(t\_2 \cdot t\_1\right)\\ \mathbf{elif}\;t \cdot t \leq 5 \cdot 10^{+62}:\\ \;\;\;\;\left(t\_2 \cdot \left(-y\right)\right) \cdot e^{\left(t \cdot t\right) \cdot 0.5}\\ \mathbf{else}:\\ \;\;\;\;t\_2 \cdot \left(t\_1 \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(t \cdot t, 0.020833333333333332, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* 0.5 x) y)) (t_2 (sqrt (* 2.0 z))))
   (if (<= (* t t) 2e-8)
     (* 1.0 (* t_2 t_1))
     (if (<= (* t t) 5e+62)
       (* (* t_2 (- y)) (exp (* (* t t) 0.5)))
       (*
        t_2
        (*
         t_1
         (fma
          (fma (fma (* t t) 0.020833333333333332 0.125) (* t t) 0.5)
          (* t t)
          1.0)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (0.5 * x) - y;
	double t_2 = sqrt((2.0 * z));
	double tmp;
	if ((t * t) <= 2e-8) {
		tmp = 1.0 * (t_2 * t_1);
	} else if ((t * t) <= 5e+62) {
		tmp = (t_2 * -y) * exp(((t * t) * 0.5));
	} else {
		tmp = t_2 * (t_1 * fma(fma(fma((t * t), 0.020833333333333332, 0.125), (t * t), 0.5), (t * t), 1.0));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(0.5 * x) - y)
	t_2 = sqrt(Float64(2.0 * z))
	tmp = 0.0
	if (Float64(t * t) <= 2e-8)
		tmp = Float64(1.0 * Float64(t_2 * t_1));
	elseif (Float64(t * t) <= 5e+62)
		tmp = Float64(Float64(t_2 * Float64(-y)) * exp(Float64(Float64(t * t) * 0.5)));
	else
		tmp = Float64(t_2 * Float64(t_1 * fma(fma(fma(Float64(t * t), 0.020833333333333332, 0.125), Float64(t * t), 0.5), Float64(t * t), 1.0)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(0.5 * x), $MachinePrecision] - y), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t * t), $MachinePrecision], 2e-8], N[(1.0 * N[(t$95$2 * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(t * t), $MachinePrecision], 5e+62], N[(N[(t$95$2 * (-y)), $MachinePrecision] * N[Exp[N[(N[(t * t), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$2 * N[(t$95$1 * N[(N[(N[(N[(t * t), $MachinePrecision] * 0.020833333333333332 + 0.125), $MachinePrecision] * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision] * N[(t * t), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 t t) < 2e-8

   1. Initial program 99.6%

      \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 99.6%

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

   if 2e-8 < (*.f64 t t) < 5.00000000000000029e62

   1. Initial program 99.9%

      \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. div-inv N/A

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

      3. metadata-eval N/A

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

      4. lower-*.f64 99.9

         \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\color{blue}{\left(t \cdot t\right) \cdot 0.5}} \]

   4. Applied rewrites 99.9%

      \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\color{blue}{\left(t \cdot t\right) \cdot 0.5}} \]

   5. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{\left(-1 \cdot y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot e^{\left(t \cdot t\right) \cdot \frac{1}{2}} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(y\right)\right)} \cdot \sqrt{z \cdot 2}\right) \cdot e^{\left(t \cdot t\right) \cdot \frac{1}{2}} \]

      2. lower-neg.f64 78.8

         \[\leadsto \left(\color{blue}{\left(-y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot e^{\left(t \cdot t\right) \cdot 0.5} \]

   7. Applied rewrites 78.8%

      \[\leadsto \left(\color{blue}{\left(-y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot e^{\left(t \cdot t\right) \cdot 0.5} \]

   if 5.00000000000000029e62 < (*.f64 t t)

   1. Initial program 100.0%

      \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\left({t}^{2} \cdot \left(\frac{1}{2} + {t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right)\right) + 1\right)} \]

      2. *-commutative N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \left(\color{blue}{\left(\frac{1}{2} + {t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right)\right) \cdot {t}^{2}} + 1\right) \]

      3. lower-fma.f64 N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\mathsf{fma}\left(\frac{1}{2} + {t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right), {t}^{2}, 1\right)} \]

      4. +-commutative N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{{t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right) + \frac{1}{2}}, {t}^{2}, 1\right) \]

      5. *-commutative N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{\left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right) \cdot {t}^{2}} + \frac{1}{2}, {t}^{2}, 1\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}, {t}^{2}, \frac{1}{2}\right)}, {t}^{2}, 1\right) \]

      7. +-commutative N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{48} \cdot {t}^{2} + \frac{1}{8}}, {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

      8. lower-fma.f64 N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{48}, {t}^{2}, \frac{1}{8}\right)}, {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

      9. unpow2 N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, \color{blue}{t \cdot t}, \frac{1}{8}\right), {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

      10. lower-*.f64 N/A

          \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, \color{blue}{t \cdot t}, \frac{1}{8}\right), {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

      11. unpow2 N/A

          \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), \color{blue}{t \cdot t}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), \color{blue}{t \cdot t}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

      13. unpow2 N/A

          \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), \color{blue}{t \cdot t}, 1\right) \]

      14. lower-*.f64 99.2

          \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332, t \cdot t, 0.125\right), t \cdot t, 0.5\right), \color{blue}{t \cdot t}, 1\right) \]

   5. Applied rewrites 99.2%

      \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332, t \cdot t, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right)} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right)} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \cdot \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \cdot \color{blue}{\left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right)} \]

      4. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \cdot \left(x \cdot \frac{1}{2} - y\right)\right) \cdot \sqrt{z \cdot 2}} \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \cdot \left(x \cdot \frac{1}{2} - y\right)\right) \cdot \sqrt{z \cdot 2}} \]

   7. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(t \cdot t, 0.020833333333333332, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right) \cdot \left(0.5 \cdot x - y\right)\right) \cdot \sqrt{2 \cdot z}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 98.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot t \leq 2 \cdot 10^{-8}:\\ \;\;\;\;1 \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right)\\ \mathbf{elif}\;t \cdot t \leq 5 \cdot 10^{+62}:\\ \;\;\;\;\left(\sqrt{2 \cdot z} \cdot \left(-y\right)\right) \cdot e^{\left(t \cdot t\right) \cdot 0.5}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2 \cdot z} \cdot \left(\left(0.5 \cdot x - y\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(t \cdot t, 0.020833333333333332, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 86.8% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \sqrt{2 \cdot z}\\ t_2 := t\_1 \cdot \left(0.5 \cdot x - y\right)\\ \mathbf{if}\;t \cdot t \leq 3.5 \cdot 10^{+98}:\\ \;\;\;\;\mathsf{fma}\left(t \cdot t, 0.5, 1\right) \cdot t\_2\\ \mathbf{elif}\;t \cdot t \leq 5 \cdot 10^{+242}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.125, t \cdot t, 0.5\right), t \cdot t, 1\right) \cdot \left(t\_1 \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(t \cdot t\right) \cdot 0.5\right) \cdot t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (sqrt (* 2.0 z))) (t_2 (* t_1 (- (* 0.5 x) y))))
   (if (<= (* t t) 3.5e+98)
     (* (fma (* t t) 0.5 1.0) t_2)
     (if (<= (* t t) 5e+242)
       (* (fma (fma 0.125 (* t t) 0.5) (* t t) 1.0) (* t_1 (- y)))
       (* (* (* t t) 0.5) t_2)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = sqrt((2.0 * z));
	double t_2 = t_1 * ((0.5 * x) - y);
	double tmp;
	if ((t * t) <= 3.5e+98) {
		tmp = fma((t * t), 0.5, 1.0) * t_2;
	} else if ((t * t) <= 5e+242) {
		tmp = fma(fma(0.125, (t * t), 0.5), (t * t), 1.0) * (t_1 * -y);
	} else {
		tmp = ((t * t) * 0.5) * t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = sqrt(Float64(2.0 * z))
	t_2 = Float64(t_1 * Float64(Float64(0.5 * x) - y))
	tmp = 0.0
	if (Float64(t * t) <= 3.5e+98)
		tmp = Float64(fma(Float64(t * t), 0.5, 1.0) * t_2);
	elseif (Float64(t * t) <= 5e+242)
		tmp = Float64(fma(fma(0.125, Float64(t * t), 0.5), Float64(t * t), 1.0) * Float64(t_1 * Float64(-y)));
	else
		tmp = Float64(Float64(Float64(t * t) * 0.5) * t_2);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[(N[(0.5 * x), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t * t), $MachinePrecision], 3.5e+98], N[(N[(N[(t * t), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[N[(t * t), $MachinePrecision], 5e+242], N[(N[(N[(0.125 * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision] * N[(t * t), $MachinePrecision] + 1.0), $MachinePrecision] * N[(t$95$1 * (-y)), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * t), $MachinePrecision] * 0.5), $MachinePrecision] * t$95$2), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 t t) < 3.5e98

   1. Initial program 99.6%

      \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 86.1

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

   5. Applied rewrites 86.1%

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

   if 3.5e98 < (*.f64 t t) < 5.0000000000000004e242

   1. Initial program 100.0%

      \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{1}{8} \cdot {t}^{2}, {t}^{2}, 1\right)} \]

      4. +-commutative N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{\frac{1}{8} \cdot {t}^{2} + \frac{1}{2}}, {t}^{2}, 1\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{8}, {t}^{2}, \frac{1}{2}\right)}, {t}^{2}, 1\right) \]

      6. unpow2 N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{8}, \color{blue}{t \cdot t}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{8}, \color{blue}{t \cdot t}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

      8. unpow2 N/A

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

      9. lower-*.f64 85.0

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

   5. Applied rewrites 85.0%

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

   6. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{\left(-1 \cdot y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{8}, t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \]
   7. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(y\right)\right)} \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{8}, t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \]

      2. lower-neg.f64 63.0

         \[\leadsto \left(\color{blue}{\left(-y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.125, t \cdot t, 0.5\right), t \cdot t, 1\right) \]

   8. Applied rewrites 63.0%

      \[\leadsto \left(\color{blue}{\left(-y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.125, t \cdot t, 0.5\right), t \cdot t, 1\right) \]

   if 5.0000000000000004e242 < (*.f64 t t)

   1. Initial program 100.0%

      \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 95.6

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

   5. Applied rewrites 95.6%

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

   6. Taylor expanded in t around inf

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \left(\frac{1}{2} \cdot \color{blue}{{t}^{2}}\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 95.6%

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

4. Final simplification 85.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot t \leq 3.5 \cdot 10^{+98}:\\ \;\;\;\;\mathsf{fma}\left(t \cdot t, 0.5, 1\right) \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right)\\ \mathbf{elif}\;t \cdot t \leq 5 \cdot 10^{+242}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.125, t \cdot t, 0.5\right), t \cdot t, 1\right) \cdot \left(\sqrt{2 \cdot z} \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(t \cdot t\right) \cdot 0.5\right) \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 96.1% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \sqrt{2 \cdot z} \cdot \left(\left(0.5 \cdot x - y\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(t \cdot t, 0.020833333333333332, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right)\right) \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (*
  (sqrt (* 2.0 z))
  (*
   (- (* 0.5 x) y)
   (fma
    (fma (fma (* t t) 0.020833333333333332 0.125) (* t t) 0.5)
    (* t t)
    1.0))))

C

double code(double x, double y, double z, double t) {
	return sqrt((2.0 * z)) * (((0.5 * x) - y) * fma(fma(fma((t * t), 0.020833333333333332, 0.125), (t * t), 0.5), (t * t), 1.0));
}

Julia

function code(x, y, z, t)
	return Float64(sqrt(Float64(2.0 * z)) * Float64(Float64(Float64(0.5 * x) - y) * fma(fma(fma(Float64(t * t), 0.020833333333333332, 0.125), Float64(t * t), 0.5), Float64(t * t), 1.0)))
end

Wolfram

code[x_, y_, z_, t_] := N[(N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision] * N[(N[(N[(0.5 * x), $MachinePrecision] - y), $MachinePrecision] * N[(N[(N[(N[(t * t), $MachinePrecision] * 0.020833333333333332 + 0.125), $MachinePrecision] * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision] * N[(t * t), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
2. Add Preprocessing

3. Taylor expanded in t around 0

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

   1. +-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\left({t}^{2} \cdot \left(\frac{1}{2} + {t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right)\right) + 1\right)} \]

   2. *-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \left(\color{blue}{\left(\frac{1}{2} + {t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right)\right) \cdot {t}^{2}} + 1\right) \]

   3. lower-fma.f64 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\mathsf{fma}\left(\frac{1}{2} + {t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right), {t}^{2}, 1\right)} \]

   4. +-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{{t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right) + \frac{1}{2}}, {t}^{2}, 1\right) \]

   5. *-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{\left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right) \cdot {t}^{2}} + \frac{1}{2}, {t}^{2}, 1\right) \]

   6. lower-fma.f64 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}, {t}^{2}, \frac{1}{2}\right)}, {t}^{2}, 1\right) \]

   7. +-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{48} \cdot {t}^{2} + \frac{1}{8}}, {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   8. lower-fma.f64 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{48}, {t}^{2}, \frac{1}{8}\right)}, {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   9. unpow2 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, \color{blue}{t \cdot t}, \frac{1}{8}\right), {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   10. lower-*.f64 N/A

       \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, \color{blue}{t \cdot t}, \frac{1}{8}\right), {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   11. unpow2 N/A

       \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), \color{blue}{t \cdot t}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   12. lower-*.f64 N/A

       \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), \color{blue}{t \cdot t}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   13. unpow2 N/A

       \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), \color{blue}{t \cdot t}, 1\right) \]

   14. lower-*.f64 92.9

       \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332, t \cdot t, 0.125\right), t \cdot t, 0.5\right), \color{blue}{t \cdot t}, 1\right) \]

5. Applied rewrites 92.9%

   \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332, t \cdot t, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right)} \]
6. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \color{blue}{\left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right)} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \cdot \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right)} \]

   3. lift-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \cdot \color{blue}{\left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right)} \]

   4. associate-*r* N/A

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \cdot \left(x \cdot \frac{1}{2} - y\right)\right) \cdot \sqrt{z \cdot 2}} \]

   5. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \cdot \left(x \cdot \frac{1}{2} - y\right)\right) \cdot \sqrt{z \cdot 2}} \]

7. Applied rewrites 93.9%

   \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(t \cdot t, 0.020833333333333332, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right) \cdot \left(0.5 \cdot x - y\right)\right) \cdot \sqrt{2 \cdot z}} \]

8. Final simplification 93.9%

   \[\leadsto \sqrt{2 \cdot z} \cdot \left(\left(0.5 \cdot x - y\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(t \cdot t, 0.020833333333333332, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right)\right) \]
9. Add Preprocessing

Alternative 5: 94.9% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332 \cdot \left(t \cdot t\right), t \cdot t, 0.5\right), t \cdot t, 1\right) \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right) \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (*
  (fma (fma (* 0.020833333333333332 (* t t)) (* t t) 0.5) (* t t) 1.0)
  (* (sqrt (* 2.0 z)) (- (* 0.5 x) y))))

C

double code(double x, double y, double z, double t) {
	return fma(fma((0.020833333333333332 * (t * t)), (t * t), 0.5), (t * t), 1.0) * (sqrt((2.0 * z)) * ((0.5 * x) - y));
}

Julia

function code(x, y, z, t)
	return Float64(fma(fma(Float64(0.020833333333333332 * Float64(t * t)), Float64(t * t), 0.5), Float64(t * t), 1.0) * Float64(sqrt(Float64(2.0 * z)) * Float64(Float64(0.5 * x) - y)))
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(0.020833333333333332 * N[(t * t), $MachinePrecision]), $MachinePrecision] * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision] * N[(t * t), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision] * N[(N[(0.5 * x), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
2. Add Preprocessing

3. Taylor expanded in t around 0

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

   1. +-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\left({t}^{2} \cdot \left(\frac{1}{2} + {t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right)\right) + 1\right)} \]

   2. *-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \left(\color{blue}{\left(\frac{1}{2} + {t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right)\right) \cdot {t}^{2}} + 1\right) \]

   3. lower-fma.f64 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\mathsf{fma}\left(\frac{1}{2} + {t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right), {t}^{2}, 1\right)} \]

   4. +-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{{t}^{2} \cdot \left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right) + \frac{1}{2}}, {t}^{2}, 1\right) \]

   5. *-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{\left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}\right) \cdot {t}^{2}} + \frac{1}{2}, {t}^{2}, 1\right) \]

   6. lower-fma.f64 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{8} + \frac{1}{48} \cdot {t}^{2}, {t}^{2}, \frac{1}{2}\right)}, {t}^{2}, 1\right) \]

   7. +-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{48} \cdot {t}^{2} + \frac{1}{8}}, {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   8. lower-fma.f64 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{48}, {t}^{2}, \frac{1}{8}\right)}, {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   9. unpow2 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, \color{blue}{t \cdot t}, \frac{1}{8}\right), {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   10. lower-*.f64 N/A

       \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, \color{blue}{t \cdot t}, \frac{1}{8}\right), {t}^{2}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   11. unpow2 N/A

       \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), \color{blue}{t \cdot t}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   12. lower-*.f64 N/A

       \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), \color{blue}{t \cdot t}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   13. unpow2 N/A

       \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48}, t \cdot t, \frac{1}{8}\right), t \cdot t, \frac{1}{2}\right), \color{blue}{t \cdot t}, 1\right) \]

   14. lower-*.f64 92.9

       \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332, t \cdot t, 0.125\right), t \cdot t, 0.5\right), \color{blue}{t \cdot t}, 1\right) \]

5. Applied rewrites 92.9%

   \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332, t \cdot t, 0.125\right), t \cdot t, 0.5\right), t \cdot t, 1\right)} \]

6. Taylor expanded in t around inf

   \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{48} \cdot {t}^{2}, t \cdot t, \frac{1}{2}\right), t \cdot t, 1\right) \]
7. Step-by-step derivation

8. Applied rewrites 92.8%

   \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332 \cdot \left(t \cdot t\right), t \cdot t, 0.5\right), t \cdot t, 1\right) \]

9. Final simplification 92.8%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.020833333333333332 \cdot \left(t \cdot t\right), t \cdot t, 0.5\right), t \cdot t, 1\right) \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right) \]
10. Add Preprocessing

Alternative 6: 93.9% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \left(\mathsf{fma}\left(\mathsf{fma}\left(0.125, t \cdot t, 0.5\right), t \cdot t, 1\right) \cdot \left(0.5 \cdot x - y\right)\right) \cdot \sqrt{2 \cdot z} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (*
  (* (fma (fma 0.125 (* t t) 0.5) (* t t) 1.0) (- (* 0.5 x) y))
  (sqrt (* 2.0 z))))

C

double code(double x, double y, double z, double t) {
	return (fma(fma(0.125, (t * t), 0.5), (t * t), 1.0) * ((0.5 * x) - y)) * sqrt((2.0 * z));
}

Julia

function code(x, y, z, t)
	return Float64(Float64(fma(fma(0.125, Float64(t * t), 0.5), Float64(t * t), 1.0) * Float64(Float64(0.5 * x) - y)) * sqrt(Float64(2.0 * z)))
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(0.125 * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision] * N[(t * t), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(0.5 * x), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
2. Add Preprocessing

3. Taylor expanded in t around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{1}{8} \cdot {t}^{2}, {t}^{2}, 1\right)} \]

   4. +-commutative N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{\frac{1}{8} \cdot {t}^{2} + \frac{1}{2}}, {t}^{2}, 1\right) \]

   5. lower-fma.f64 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{8}, {t}^{2}, \frac{1}{2}\right)}, {t}^{2}, 1\right) \]

   6. unpow2 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{8}, \color{blue}{t \cdot t}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   7. lower-*.f64 N/A

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{8}, \color{blue}{t \cdot t}, \frac{1}{2}\right), {t}^{2}, 1\right) \]

   8. unpow2 N/A

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

   9. lower-*.f64 90.3

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

5. Applied rewrites 90.3%

   \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.125, t \cdot t, 0.5\right), t \cdot t, 1\right)} \]
6. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. associate-*r* N/A

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

   5. lower-*.f64 N/A

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

   6. lower-*.f64 92.1

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

   7. lift-*.f64 N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 92.1

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

   10. lift-*.f64 N/A

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

   11. *-commutative N/A

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

   12. lower-*.f64 92.1

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

7. Applied rewrites 92.1%

   \[\leadsto \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.125, t \cdot t, 0.5\right), t \cdot t, 1\right) \cdot \left(0.5 \cdot x - y\right)\right) \cdot \sqrt{2 \cdot z}} \]
8. Add Preprocessing

Alternative 7: 85.0% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\\ \mathbf{if}\;t \cdot t \leq 3.3 \cdot 10^{-10}:\\ \;\;\;\;1 \cdot t\_1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(t \cdot t\right) \cdot 0.5\right) \cdot t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (sqrt (* 2.0 z)) (- (* 0.5 x) y))))
   (if (<= (* t t) 3.3e-10) (* 1.0 t_1) (* (* (* t t) 0.5) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = sqrt((2.0 * z)) * ((0.5 * x) - y);
	double tmp;
	if ((t * t) <= 3.3e-10) {
		tmp = 1.0 * t_1;
	} else {
		tmp = ((t * t) * 0.5) * t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = sqrt((2.0d0 * z)) * ((0.5d0 * x) - y)
    if ((t * t) <= 3.3d-10) then
        tmp = 1.0d0 * t_1
    else
        tmp = ((t * t) * 0.5d0) * t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((2.0 * z)) * ((0.5 * x) - y);
	double tmp;
	if ((t * t) <= 3.3e-10) {
		tmp = 1.0 * t_1;
	} else {
		tmp = ((t * t) * 0.5) * t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = math.sqrt((2.0 * z)) * ((0.5 * x) - y)
	tmp = 0
	if (t * t) <= 3.3e-10:
		tmp = 1.0 * t_1
	else:
		tmp = ((t * t) * 0.5) * t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(sqrt(Float64(2.0 * z)) * Float64(Float64(0.5 * x) - y))
	tmp = 0.0
	if (Float64(t * t) <= 3.3e-10)
		tmp = Float64(1.0 * t_1);
	else
		tmp = Float64(Float64(Float64(t * t) * 0.5) * t_1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((2.0 * z)) * ((0.5 * x) - y);
	tmp = 0.0;
	if ((t * t) <= 3.3e-10)
		tmp = 1.0 * t_1;
	else
		tmp = ((t * t) * 0.5) * t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision] * N[(N[(0.5 * x), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t * t), $MachinePrecision], 3.3e-10], N[(1.0 * t$95$1), $MachinePrecision], N[(N[(N[(t * t), $MachinePrecision] * 0.5), $MachinePrecision] * t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 t t) < 3.3e-10

   1. Initial program 99.6%

      \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 99.6%

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

   if 3.3e-10 < (*.f64 t t)

   1. Initial program 100.0%

      \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 63.4

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

   5. Applied rewrites 63.4%

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

   6. Taylor expanded in t around inf

      \[\leadsto \left(\left(x \cdot \frac{1}{2} - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \left(\frac{1}{2} \cdot \color{blue}{{t}^{2}}\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 63.4%

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

4. Final simplification 81.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot t \leq 3.3 \cdot 10^{-10}:\\ \;\;\;\;1 \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(t \cdot t\right) \cdot 0.5\right) \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 68.7% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \sqrt{2 \cdot z}\\ \mathbf{if}\;t \cdot t \leq 6.5 \cdot 10^{+72}:\\ \;\;\;\;1 \cdot \left(t\_1 \cdot \left(0.5 \cdot x - y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(x, 0.5, y\right) \cdot \mathsf{fma}\left(t \cdot t, 0.5, 1\right)\right) \cdot t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (sqrt (* 2.0 z))))
   (if (<= (* t t) 6.5e+72)
     (* 1.0 (* t_1 (- (* 0.5 x) y)))
     (* (* (fma x 0.5 y) (fma (* t t) 0.5 1.0)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = sqrt((2.0 * z));
	double tmp;
	if ((t * t) <= 6.5e+72) {
		tmp = 1.0 * (t_1 * ((0.5 * x) - y));
	} else {
		tmp = (fma(x, 0.5, y) * fma((t * t), 0.5, 1.0)) * t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = sqrt(Float64(2.0 * z))
	tmp = 0.0
	if (Float64(t * t) <= 6.5e+72)
		tmp = Float64(1.0 * Float64(t_1 * Float64(Float64(0.5 * x) - y)));
	else
		tmp = Float64(Float64(fma(x, 0.5, y) * fma(Float64(t * t), 0.5, 1.0)) * t_1);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t * t), $MachinePrecision], 6.5e+72], N[(1.0 * N[(t$95$1 * N[(N[(0.5 * x), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 0.5 + y), $MachinePrecision] * N[(N[(t * t), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 t t) < 6.5000000000000001e72

   1. Initial program 99.6%

      \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 86.5%

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

   if 6.5000000000000001e72 < (*.f64 t t)

   1. Initial program 100.0%

      \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 73.8

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

   5. Applied rewrites 73.8%

      \[\leadsto \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot \color{blue}{\mathsf{fma}\left(t \cdot t, 0.5, 1\right)} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*r* N/A

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

      8. lower-*.f64 N/A

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

   7. Applied rewrites 45.7%

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(t \cdot t, 0.5, 1\right) \cdot \mathsf{fma}\left(x, 0.5, y\right)\right) \cdot \sqrt{2 \cdot z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 69.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot t \leq 6.5 \cdot 10^{+72}:\\ \;\;\;\;1 \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(x, 0.5, y\right) \cdot \mathsf{fma}\left(t \cdot t, 0.5, 1\right)\right) \cdot \sqrt{2 \cdot z}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 85.4% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(t \cdot t, 0.5, 1\right) \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right) \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (* (fma (* t t) 0.5 1.0) (* (sqrt (* 2.0 z)) (- (* 0.5 x) y))))

C

double code(double x, double y, double z, double t) {
	return fma((t * t), 0.5, 1.0) * (sqrt((2.0 * z)) * ((0.5 * x) - y));
}

Julia

function code(x, y, z, t)
	return Float64(fma(Float64(t * t), 0.5, 1.0) * Float64(sqrt(Float64(2.0 * z)) * Float64(Float64(0.5 * x) - y)))
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(t * t), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision] * N[(N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision] * N[(N[(0.5 * x), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
2. Add Preprocessing

3. Taylor expanded in t around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. unpow2 N/A

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

   5. lower-*.f64 81.4

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

5. Applied rewrites 81.4%

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

6. Final simplification 81.4%

   \[\leadsto \mathsf{fma}\left(t \cdot t, 0.5, 1\right) \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right) \]
7. Add Preprocessing

Alternative 10: 56.5% accurate, 4.4× speedup

Math

\[\begin{array}{l} \\ 1 \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right) \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (* 1.0 (* (sqrt (* 2.0 z)) (- (* 0.5 x) y))))

C

double code(double x, double y, double z, double t) {
	return 1.0 * (sqrt((2.0 * z)) * ((0.5 * x) - y));
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = 1.0d0 * (sqrt((2.0d0 * z)) * ((0.5d0 * x) - y))
end function

Java

public static double code(double x, double y, double z, double t) {
	return 1.0 * (Math.sqrt((2.0 * z)) * ((0.5 * x) - y));
}

Python

def code(x, y, z, t):
	return 1.0 * (math.sqrt((2.0 * z)) * ((0.5 * x) - y))

Julia

function code(x, y, z, t)
	return Float64(1.0 * Float64(sqrt(Float64(2.0 * z)) * Float64(Float64(0.5 * x) - y)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = 1.0 * (sqrt((2.0 * z)) * ((0.5 * x) - y));
end

Wolfram

code[x_, y_, z_, t_] := N[(1.0 * N[(N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision] * N[(N[(0.5 * x), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
2. Add Preprocessing

3. Taylor expanded in t around 0

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

5. Applied rewrites 56.1%

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

6. Final simplification 56.1%

   \[\leadsto 1 \cdot \left(\sqrt{2 \cdot z} \cdot \left(0.5 \cdot x - y\right)\right) \]
7. Add Preprocessing

Alternative 11: 29.7% accurate, 5.4× speedup

Math

\[\begin{array}{l} \\ \left(\sqrt{2 \cdot z} \cdot \left(-y\right)\right) \cdot 1 \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (* (* (sqrt (* 2.0 z)) (- y)) 1.0))

C

double code(double x, double y, double z, double t) {
	return (sqrt((2.0 * z)) * -y) * 1.0;
}

Fortran

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

Java

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

Python

def code(x, y, z, t):
	return (math.sqrt((2.0 * z)) * -y) * 1.0

Julia

function code(x, y, z, t)
	return Float64(Float64(sqrt(Float64(2.0 * z)) * Float64(-y)) * 1.0)
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (sqrt((2.0 * z)) * -y) * 1.0;
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[Sqrt[N[(2.0 * z), $MachinePrecision]], $MachinePrecision] * (-y)), $MachinePrecision] * 1.0), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
2. Add Preprocessing

3. Taylor expanded in t around 0

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

5. Applied rewrites 56.1%

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

6. Taylor expanded in x around 0

   \[\leadsto \left(\color{blue}{\left(-1 \cdot y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot 1 \]
7. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(y\right)\right)} \cdot \sqrt{z \cdot 2}\right) \cdot 1 \]

   2. lower-neg.f64 27.0

      \[\leadsto \left(\color{blue}{\left(-y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot 1 \]

8. Applied rewrites 27.0%

   \[\leadsto \left(\color{blue}{\left(-y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot 1 \]

9. Final simplification 27.0%

   \[\leadsto \left(\sqrt{2 \cdot z} \cdot \left(-y\right)\right) \cdot 1 \]
10. Add Preprocessing

Alternative 12: 2.5% accurate, 6.3× speedup

Math

\[\begin{array}{l} \\ \left(y \cdot \sqrt{z + z}\right) \cdot 1 \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (* (* y (sqrt (+ z z))) 1.0))

C

double code(double x, double y, double z, double t) {
	return (y * sqrt((z + z))) * 1.0;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (y * sqrt((z + z))) * 1.0d0
end function

Java

public static double code(double x, double y, double z, double t) {
	return (y * Math.sqrt((z + z))) * 1.0;
}

Python

def code(x, y, z, t):
	return (y * math.sqrt((z + z))) * 1.0

Julia

function code(x, y, z, t)
	return Float64(Float64(y * sqrt(Float64(z + z))) * 1.0)
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (y * sqrt((z + z))) * 1.0;
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(y * N[Sqrt[N[(z + z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot e^{\frac{t \cdot t}{2}} \]
2. Add Preprocessing

3. Taylor expanded in t around 0

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

5. Applied rewrites 56.1%

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

6. Taylor expanded in x around 0

   \[\leadsto \left(\color{blue}{\left(-1 \cdot y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot 1 \]
7. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(y\right)\right)} \cdot \sqrt{z \cdot 2}\right) \cdot 1 \]

   2. lower-neg.f64 27.0

      \[\leadsto \left(\color{blue}{\left(-y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot 1 \]

8. Applied rewrites 27.0%

   \[\leadsto \left(\color{blue}{\left(-y\right)} \cdot \sqrt{z \cdot 2}\right) \cdot 1 \]
9. Step-by-step derivation

10. Applied rewrites 1.9%

    \[\leadsto \color{blue}{\left(\sqrt{2 \cdot z} \cdot y\right) \cdot 1} \]
11. Step-by-step derivation

    1. lift-*.f64 N/A

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

    2. count-2-rev N/A

       \[\leadsto \left(\sqrt{\color{blue}{z + z}} \cdot y\right) \cdot 1 \]

    3. lower-+.f64 1.9

       \[\leadsto \left(\sqrt{\color{blue}{z + z}} \cdot y\right) \cdot 1 \]

12. Applied rewrites 1.9%

    \[\leadsto \left(\sqrt{\color{blue}{z + z}} \cdot y\right) \cdot 1 \]

13. Final simplification 1.9%

    \[\leadsto \left(y \cdot \sqrt{z + z}\right) \cdot 1 \]
14. Add Preprocessing

Developer Target 1: 99.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \left(\left(x \cdot 0.5 - y\right) \cdot \sqrt{z \cdot 2}\right) \cdot {\left(e^{1}\right)}^{\left(\frac{t \cdot t}{2}\right)} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (* (* (- (* x 0.5) y) (sqrt (* z 2.0))) (pow (exp 1.0) (/ (* t t) 2.0))))

C

double code(double x, double y, double z, double t) {
	return (((x * 0.5) - y) * sqrt((z * 2.0))) * pow(exp(1.0), ((t * t) / 2.0));
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (((x * 0.5d0) - y) * sqrt((z * 2.0d0))) * (exp(1.0d0) ** ((t * t) / 2.0d0))
end function

Java

public static double code(double x, double y, double z, double t) {
	return (((x * 0.5) - y) * Math.sqrt((z * 2.0))) * Math.pow(Math.exp(1.0), ((t * t) / 2.0));
}

Python

def code(x, y, z, t):
	return (((x * 0.5) - y) * math.sqrt((z * 2.0))) * math.pow(math.exp(1.0), ((t * t) / 2.0))

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(x * 0.5) - y) * sqrt(Float64(z * 2.0))) * (exp(1.0) ^ Float64(Float64(t * t) / 2.0)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((x * 0.5) - y) * sqrt((z * 2.0))) * (exp(1.0) ^ ((t * t) / 2.0));
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(x * 0.5), $MachinePrecision] - y), $MachinePrecision] * N[Sqrt[N[(z * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Power[N[Exp[1.0], $MachinePrecision], N[(N[(t * t), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024298 
(FPCore (x y z t)
  :name "Data.Number.Erf:$cinvnormcdf from erf-2.0.0.0, A"
  :precision binary64

  :alt
  (! :herbie-platform default (* (* (- (* x 1/2) y) (sqrt (* z 2))) (pow (exp 1) (/ (* t t) 2))))

  (* (* (- (* x 0.5) y) (sqrt (* z 2.0))) (exp (/ (* t t) 2.0))))