Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, B

Percentage Accurate: 99.9% → 100.0%

Time: 4.5s

Alternatives: 6

Speedup: 1.2×

• could not determine a ground truth

  1. x = 3.540090767922244e+88
  2. y = -223080556.8804166
  3. z = -7.194696867048676e-124
  4. t = 7.749379670882336e+87

Specification

Math

\[\begin{array}{l} \\ \left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))

C

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

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 / 8.0d0) * x) - ((y * z) / 2.0d0)) + t
end function

Java

public static double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}

Python

def code(x, y, z, t):
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))

C

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

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 / 8.0d0) * x) - ((y * z) / 2.0d0)) + t
end function

Java

public static double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}

Python

def code(x, y, z, t):
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (+ (fma (* z -0.5) y (* 0.125 x)) t))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. associate-+l- 100.0%

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

   2. *-commutative 100.0%

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

   3. associate-+l- 100.0%

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

   4. metadata-eval 100.0%

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

   5. *-commutative 100.0%

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

   6. associate-/l* 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\left(0.125 \cdot x - y \cdot \frac{z}{2}\right) + t} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. sub-neg 100.0%

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

   2. +-commutative 100.0%

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

   3. *-commutative 100.0%

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

   4. distribute-lft-neg-in 100.0%

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

   5. fma-define 100.0%

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

   6. div-inv 100.0%

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

   7. distribute-rgt-neg-in 100.0%

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

   8. metadata-eval 100.0%

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

   9. metadata-eval 100.0%

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

6. Applied egg-rr 100.0%

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

7. Final simplification 100.0%

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

Alternative 2: 80.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8.5 \cdot 10^{+67} \lor \neg \left(y \leq 4.8 \cdot 10^{-97}\right):\\ \;\;\;\;t + y \cdot \left(z \cdot -0.5\right)\\ \mathbf{else}:\\ \;\;\;\;0.125 \cdot x + t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -8.5e+67) (not (<= y 4.8e-97)))
   (+ t (* y (* z -0.5)))
   (+ (* 0.125 x) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -8.5e+67) || !(y <= 4.8e-97)) {
		tmp = t + (y * (z * -0.5));
	} else {
		tmp = (0.125 * x) + t;
	}
	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) :: tmp
    if ((y <= (-8.5d+67)) .or. (.not. (y <= 4.8d-97))) then
        tmp = t + (y * (z * (-0.5d0)))
    else
        tmp = (0.125d0 * x) + t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -8.5e+67) || !(y <= 4.8e-97)) {
		tmp = t + (y * (z * -0.5));
	} else {
		tmp = (0.125 * x) + t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (y <= -8.5e+67) or not (y <= 4.8e-97):
		tmp = t + (y * (z * -0.5))
	else:
		tmp = (0.125 * x) + t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -8.5e+67) || !(y <= 4.8e-97))
		tmp = Float64(t + Float64(y * Float64(z * -0.5)));
	else
		tmp = Float64(Float64(0.125 * x) + t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((y <= -8.5e+67) || ~((y <= 4.8e-97)))
		tmp = t + (y * (z * -0.5));
	else
		tmp = (0.125 * x) + t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -8.5e+67], N[Not[LessEqual[y, 4.8e-97]], $MachinePrecision]], N[(t + N[(y * N[(z * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.125 * x), $MachinePrecision] + t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -8.50000000000000038e67 or 4.8e-97 < y

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. *-commutative 100.0%

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

      3. associate-+l- 100.0%

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

      4. metadata-eval 100.0%

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

      5. *-commutative 100.0%

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

      6. associate-/l* 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(0.125 \cdot x - y \cdot \frac{z}{2}\right) + t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 78.2%

      \[\leadsto \color{blue}{-0.5 \cdot \left(y \cdot z\right)} + t \]
   6. Step-by-step derivation

      1. *-commutative 78.2%

         \[\leadsto \color{blue}{\left(y \cdot z\right) \cdot -0.5} + t \]

      2. associate-*r* 78.2%

         \[\leadsto \color{blue}{y \cdot \left(z \cdot -0.5\right)} + t \]

      3. *-commutative 78.2%

         \[\leadsto y \cdot \color{blue}{\left(-0.5 \cdot z\right)} + t \]

   7. Simplified 78.2%

      \[\leadsto \color{blue}{y \cdot \left(-0.5 \cdot z\right)} + t \]

   if -8.50000000000000038e67 < y < 4.8e-97

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. *-commutative 100.0%

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

      3. associate-+l- 100.0%

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

      4. metadata-eval 100.0%

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

      5. *-commutative 100.0%

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

      6. associate-/l* 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(0.125 \cdot x - y \cdot \frac{z}{2}\right) + t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 83.8%

      \[\leadsto \color{blue}{0.125 \cdot x} + t \]
3. Recombined 2 regimes into one program.

4. Final simplification 80.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8.5 \cdot 10^{+67} \lor \neg \left(y \leq 4.8 \cdot 10^{-97}\right):\\ \;\;\;\;t + y \cdot \left(z \cdot -0.5\right)\\ \mathbf{else}:\\ \;\;\;\;0.125 \cdot x + t\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 48.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.15 \cdot 10^{-147} \lor \neg \left(z \leq 1.65 \cdot 10^{+43}\right):\\ \;\;\;\;z \cdot \left(-0.5 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -1.15e-147) (not (<= z 1.65e+43))) (* z (* -0.5 y)) t))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.15e-147) || !(z <= 1.65e+43)) {
		tmp = z * (-0.5 * y);
	} else {
		tmp = t;
	}
	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) :: tmp
    if ((z <= (-1.15d-147)) .or. (.not. (z <= 1.65d+43))) then
        tmp = z * ((-0.5d0) * y)
    else
        tmp = t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.15e-147) || !(z <= 1.65e+43)) {
		tmp = z * (-0.5 * y);
	} else {
		tmp = t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -1.15e-147) or not (z <= 1.65e+43):
		tmp = z * (-0.5 * y)
	else:
		tmp = t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -1.15e-147) || !(z <= 1.65e+43))
		tmp = Float64(z * Float64(-0.5 * y));
	else
		tmp = t;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -1.15e-147) || ~((z <= 1.65e+43)))
		tmp = z * (-0.5 * y);
	else
		tmp = t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -1.15e-147], N[Not[LessEqual[z, 1.65e+43]], $MachinePrecision]], N[(z * N[(-0.5 * y), $MachinePrecision]), $MachinePrecision], t]

Derivation

1. Split input into 2 regimes

2. if z < -1.14999999999999995e-147 or 1.6500000000000001e43 < z

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. *-commutative 100.0%

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

      3. associate-+l- 100.0%

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

      4. metadata-eval 100.0%

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

      5. *-commutative 100.0%

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

      6. associate-/l* 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(0.125 \cdot x - y \cdot \frac{z}{2}\right) + t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 79.5%

      \[\leadsto \color{blue}{-0.5 \cdot \left(y \cdot z\right)} + t \]
   6. Step-by-step derivation

      1. *-commutative 79.5%

         \[\leadsto \color{blue}{\left(y \cdot z\right) \cdot -0.5} + t \]

      2. associate-*r* 79.5%

         \[\leadsto \color{blue}{y \cdot \left(z \cdot -0.5\right)} + t \]

      3. *-commutative 79.5%

         \[\leadsto y \cdot \color{blue}{\left(-0.5 \cdot z\right)} + t \]

   7. Simplified 79.5%

      \[\leadsto \color{blue}{y \cdot \left(-0.5 \cdot z\right)} + t \]

   8. Taylor expanded in y around inf 58.2%

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

      1. associate-*r* 58.2%

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

      2. *-commutative 58.2%

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

      3. *-commutative 58.2%

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

      4. *-commutative 58.2%

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

   10. Simplified 58.2%

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

   if -1.14999999999999995e-147 < z < 1.6500000000000001e43

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. *-commutative 100.0%

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

      3. associate-+l- 100.0%

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

      4. metadata-eval 100.0%

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

      5. *-commutative 100.0%

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

      6. associate-/l* 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(0.125 \cdot x - y \cdot \frac{z}{2}\right) + t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 62.4%

      \[\leadsto \color{blue}{-0.5 \cdot \left(y \cdot z\right)} + t \]
   6. Step-by-step derivation

      1. *-commutative 62.4%

         \[\leadsto \color{blue}{\left(y \cdot z\right) \cdot -0.5} + t \]

      2. associate-*r* 62.4%

         \[\leadsto \color{blue}{y \cdot \left(z \cdot -0.5\right)} + t \]

      3. *-commutative 62.4%

         \[\leadsto y \cdot \color{blue}{\left(-0.5 \cdot z\right)} + t \]

   7. Simplified 62.4%

      \[\leadsto \color{blue}{y \cdot \left(-0.5 \cdot z\right)} + t \]

   8. Taylor expanded in y around 0 50.7%

      \[\leadsto \color{blue}{t} \]
3. Recombined 2 regimes into one program.

4. Final simplification 55.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.15 \cdot 10^{-147} \lor \neg \left(z \leq 1.65 \cdot 10^{+43}\right):\\ \;\;\;\;z \cdot \left(-0.5 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 72.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{-11} \lor \neg \left(z \leq 8.8 \cdot 10^{+94}\right):\\ \;\;\;\;z \cdot \left(-0.5 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;0.125 \cdot x + t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -1.25e-11) (not (<= z 8.8e+94)))
   (* z (* -0.5 y))
   (+ (* 0.125 x) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.25e-11) || !(z <= 8.8e+94)) {
		tmp = z * (-0.5 * y);
	} else {
		tmp = (0.125 * x) + t;
	}
	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) :: tmp
    if ((z <= (-1.25d-11)) .or. (.not. (z <= 8.8d+94))) then
        tmp = z * ((-0.5d0) * y)
    else
        tmp = (0.125d0 * x) + t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.25e-11) || !(z <= 8.8e+94)) {
		tmp = z * (-0.5 * y);
	} else {
		tmp = (0.125 * x) + t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -1.25e-11) or not (z <= 8.8e+94):
		tmp = z * (-0.5 * y)
	else:
		tmp = (0.125 * x) + t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -1.25e-11) || !(z <= 8.8e+94))
		tmp = Float64(z * Float64(-0.5 * y));
	else
		tmp = Float64(Float64(0.125 * x) + t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -1.25e-11) || ~((z <= 8.8e+94)))
		tmp = z * (-0.5 * y);
	else
		tmp = (0.125 * x) + t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -1.25e-11], N[Not[LessEqual[z, 8.8e+94]], $MachinePrecision]], N[(z * N[(-0.5 * y), $MachinePrecision]), $MachinePrecision], N[(N[(0.125 * x), $MachinePrecision] + t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.25000000000000005e-11 or 8.80000000000000047e94 < z

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. *-commutative 100.0%

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

      3. associate-+l- 100.0%

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

      4. metadata-eval 100.0%

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

      5. *-commutative 100.0%

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

      6. associate-/l* 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(0.125 \cdot x - y \cdot \frac{z}{2}\right) + t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 86.7%

      \[\leadsto \color{blue}{-0.5 \cdot \left(y \cdot z\right)} + t \]
   6. Step-by-step derivation

      1. *-commutative 86.7%

         \[\leadsto \color{blue}{\left(y \cdot z\right) \cdot -0.5} + t \]

      2. associate-*r* 86.7%

         \[\leadsto \color{blue}{y \cdot \left(z \cdot -0.5\right)} + t \]

      3. *-commutative 86.7%

         \[\leadsto y \cdot \color{blue}{\left(-0.5 \cdot z\right)} + t \]

   7. Simplified 86.7%

      \[\leadsto \color{blue}{y \cdot \left(-0.5 \cdot z\right)} + t \]

   8. Taylor expanded in y around inf 69.0%

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

      1. associate-*r* 69.0%

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

      2. *-commutative 69.0%

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

      3. *-commutative 69.0%

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

      4. *-commutative 69.0%

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

   10. Simplified 69.0%

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

   if -1.25000000000000005e-11 < z < 8.80000000000000047e94

   1. Initial program 100.0%

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

      1. associate-+l- 100.0%

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

      2. *-commutative 100.0%

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

      3. associate-+l- 100.0%

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

      4. metadata-eval 100.0%

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

      5. *-commutative 100.0%

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

      6. associate-/l* 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(0.125 \cdot x - y \cdot \frac{z}{2}\right) + t} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 83.0%

      \[\leadsto \color{blue}{0.125 \cdot x} + t \]
3. Recombined 2 regimes into one program.

4. Final simplification 77.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{-11} \lor \neg \left(z \leq 8.8 \cdot 10^{+94}\right):\\ \;\;\;\;z \cdot \left(-0.5 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;0.125 \cdot x + t\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ t + \left(0.125 \cdot x - y \cdot \frac{z}{2}\right) \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (+ t (- (* 0.125 x) (* y (/ z 2.0)))))

C

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

Java

public static double code(double x, double y, double z, double t) {
	return t + ((0.125 * x) - (y * (z / 2.0)));
}

Python

def code(x, y, z, t):
	return t + ((0.125 * x) - (y * (z / 2.0)))

Julia

function code(x, y, z, t)
	return Float64(t + Float64(Float64(0.125 * x) - Float64(y * Float64(z / 2.0))))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = t + ((0.125 * x) - (y * (z / 2.0)));
end

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. associate-+l- 100.0%

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

   2. *-commutative 100.0%

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

   3. associate-+l- 100.0%

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

   4. metadata-eval 100.0%

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

   5. *-commutative 100.0%

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

   6. associate-/l* 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\left(0.125 \cdot x - y \cdot \frac{z}{2}\right) + t} \]
4. Add Preprocessing

5. Final simplification 100.0%

   \[\leadsto t + \left(0.125 \cdot x - y \cdot \frac{z}{2}\right) \]
6. Add Preprocessing

Alternative 6: 32.9% accurate, 13.0× speedup

Math

\[\begin{array}{l} \\ t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 t)

C

double code(double x, double y, double z, double t) {
	return t;
}

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 = t
end function

Java

public static double code(double x, double y, double z, double t) {
	return t;
}

Python

def code(x, y, z, t):
	return t

Julia

function code(x, y, z, t)
	return t
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = t;
end

Wolfram

code[x_, y_, z_, t_] := t

Derivation

1. Initial program 100.0%

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

   1. associate-+l- 100.0%

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

   2. *-commutative 100.0%

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

   3. associate-+l- 100.0%

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

   4. metadata-eval 100.0%

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

   5. *-commutative 100.0%

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

   6. associate-/l* 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\left(0.125 \cdot x - y \cdot \frac{z}{2}\right) + t} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 72.5%

   \[\leadsto \color{blue}{-0.5 \cdot \left(y \cdot z\right)} + t \]
6. Step-by-step derivation

   1. *-commutative 72.5%

      \[\leadsto \color{blue}{\left(y \cdot z\right) \cdot -0.5} + t \]

   2. associate-*r* 72.5%

      \[\leadsto \color{blue}{y \cdot \left(z \cdot -0.5\right)} + t \]

   3. *-commutative 72.5%

      \[\leadsto y \cdot \color{blue}{\left(-0.5 \cdot z\right)} + t \]

7. Simplified 72.5%

   \[\leadsto \color{blue}{y \cdot \left(-0.5 \cdot z\right)} + t \]

8. Taylor expanded in y around 0 34.4%

   \[\leadsto \color{blue}{t} \]

9. Final simplification 34.4%

   \[\leadsto t \]
10. Add Preprocessing

Developer target: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \left(\frac{x}{8} + t\right) - \frac{z}{2} \cdot y \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (- (+ (/ x 8.0) t) (* (/ z 2.0) y)))

C

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

Java

public static double code(double x, double y, double z, double t) {
	return ((x / 8.0) + t) - ((z / 2.0) * y);
}

Python

def code(x, y, z, t):
	return ((x / 8.0) + t) - ((z / 2.0) * y)

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x / 8.0) + t) - Float64(Float64(z / 2.0) * y))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = ((x / 8.0) + t) - ((z / 2.0) * y);
end

Wolfram

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

Reproduce

herbie shell --seed 2024062 
(FPCore (x y z t)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, B"
  :precision binary64

  :herbie-target
  (- (+ (/ x 8.0) t) (* (/ z 2.0) y))

  (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))