Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H

Average Error: 0.0 → 0.0

Time: 3.5s

Precision: binary64

Cost: 448

Math

\[\left(x + y\right) \cdot \left(1 - z\right) \]

↓

\[\left(1 - z\right) \cdot \left(x + y\right) \]

FPCore

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

↓

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

C

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

↓

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

Fortran

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

↓

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

Java

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

↓

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

Python

def code(x, y, z):
	return (x + y) * (1.0 - z)

↓

def code(x, y, z):
	return (1.0 - z) * (x + y)

Julia

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

↓

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

MATLAB

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

↓

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

Wolfram

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

↓

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

Derivation

1. Initial program 0.0

   \[\left(x + y\right) \cdot \left(1 - z\right) \]

2. Final simplification 0.0

   \[\leadsto \left(1 - z\right) \cdot \left(x + y\right) \]

Alternatives

Alternative 1
Error	1.7
Cost	904

\[\begin{array}{l} t_0 := z \cdot \left(\left(-x\right) - y\right)\\ \mathbf{if}\;1 - z \leq -0.05:\\ \;\;\;\;t_0\\ \mathbf{elif}\;1 - z \leq 2:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 2
Error	12.9
Cost	716

\[\begin{array}{l} t_0 := y \cdot \left(1 - z\right)\\ \mathbf{if}\;z \leq -1.8 \cdot 10^{-8}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 0.00126:\\ \;\;\;\;x + y\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{+81}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-x\right)\\ \end{array} \]

Alternative 3
Error	25.1
Cost	716

\[\begin{array}{l} t_0 := x \cdot \left(1 - z\right)\\ \mathbf{if}\;x \leq -1.75 \cdot 10^{-19}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq -8 \cdot 10^{-113}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;x \leq -2.5 \cdot 10^{-146}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - z\right)\\ \end{array} \]

Alternative 4
Error	13.1
Cost	652

\[\begin{array}{l} t_0 := z \cdot \left(-x\right)\\ \mathbf{if}\;z \leq -420:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 1:\\ \;\;\;\;x + y\\ \mathbf{elif}\;z \leq 5.9 \cdot 10^{+82}:\\ \;\;\;\;y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 5
Error	13.6
Cost	520

\[\begin{array}{l} t_0 := y \cdot \left(-z\right)\\ \mathbf{if}\;z \leq -1.3 \cdot 10^{+17}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 1:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 6
Error	39.0
Cost	196

\[\begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{-62}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]

Alternative 7
Error	24.1
Cost	192

\[x + y \]

Alternative 8
Error	43.2
Cost	64

\[x \]

Reproduce

herbie shell --seed 2022335 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  :precision binary64
  (* (+ x y) (- 1.0 z)))