Metrics for Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 9 to 8 computations (11.1% saved)

sample540.0ms (37.3%)

Memory

21.7MiB live, 853.4MiB allocated; 171ms collecting garbage

Samples

342.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 129.0ms

ival-mult!: 91.0ms (70.4% of total)

ival-add!: 37.0ms (28.6% of total)

adjust: 1.0ms (0.8% of total)

Bogosity

preprocess71.0ms (4.9%)

Memory

-15.8MiB live, 72.0MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	28	77
1	103	71
2	288	71
3	561	71
4	773	71
5	1326	71
6	4659	71

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.9%	(+.f64 x (.f64 (.f64 y z) z))

Symmetry

(abs z)

Compiler

Compiled 12 to 12 computations (0% saved)

series8.0ms (0.6%)

Memory

19.0MiB live, 19.0MiB allocated; 0ms collecting garbage

Counts

6 → 11

Calls

Call 1

Inputs
(+.f64 x (.f64 (.f64 y z) z))
x
(.f64 (.f64 y z) z)
(*.f64 y z)
y
z

Outputs
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (pow z 2))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (+ x (* y (pow z 2)))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* x (+ 1 (/ (* y (pow z 2)) x)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* x (- (* -1 (/ (* y (pow z 2)) x)) 1)))))
#s(approx (* y z) #s(hole binary64 (* y z)))
#s(approx y #s(hole binary64 y))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (+ (/ x y) (pow z 2)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* y (+ (* -1 (/ x y)) (* -1 (pow z 2)))))))
#s(approx z #s(hole binary64 z))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* (pow z 2) (+ y (/ x (pow z 2))))))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	z	@	inf	((+ x (* (* y z) z)) x (* (* y z) z) (* y z) y z)
1.0ms	y	@	-inf	((+ x (* (* y z) z)) x (* (* y z) z) (* y z) y z)
1.0ms	y	@	0	((+ x (* (* y z) z)) x (* (* y z) z) (* y z) y z)
1.0ms	z	@	-inf	((+ x (* (* y z) z)) x (* (* y z) z) (* y z) y z)
1.0ms	y	@	inf	((+ x (* (* y z) z)) x (* (* y z) z) (* y z) y z)

rewrite185.0ms (12.8%)

Memory

-3.4MiB live, 177.4MiB allocated; 49ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	44	163
0	47	145
1	258	145
2	1556	141

Stop Event

1×	iter-limit
1×	unsound
1×	node-limit
1×	iter-limit

Counts

17 → 15

Calls

Call 1

Inputs
(+.f64 x (.f64 (.f64 y z) z))
x
(.f64 (.f64 y z) z)
(*.f64 y z)
y
z
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (pow z 2))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (+ x (* y (pow z 2)))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* x (+ 1 (/ (* y (pow z 2)) x)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* x (- (* -1 (/ (* y (pow z 2)) x)) 1)))))
#s(approx (* y z) #s(hole binary64 (* y z)))
#s(approx y #s(hole binary64 y))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (+ (/ x y) (pow z 2)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* y (+ (* -1 (/ x y)) (* -1 (pow z 2)))))))
#s(approx z #s(hole binary64 z))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* (pow z 2) (+ y (/ x (pow z 2))))))

Outputs
(+.f64 x (.f64 (.f64 y z) z))
x
(.f64 (.f64 y z) z)
(*.f64 y z)
y
z
#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))
#s(approx (+ x (* (* y z) z)) (+.f64 x (.f64 (.f64 y z) z)))
#s(approx x x)
#s(approx (* y z) (*.f64 y z))
#s(approx y y)
#s(approx (+ x (* (* y z) z)) (+.f64 x (.f64 (.f64 y z) z)))
#s(approx (+ x (* (* y z) z)) (+.f64 x (.f64 (.f64 y z) z)))
#s(approx z z)
#s(approx (+ x (* (* y z) z)) (+.f64 x (.f64 (.f64 y z) z)))

eval1.0ms (0%)

Memory: 1.5MiB live, 1.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 34 to 24 computations (29.4% saved)

prune1.0ms (0.1%)

Memory

2.2MiB live, 2.2MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	5	1	6
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	5	2	7

Accuracy

99.9%

Counts

7 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.9%	(+.f64 x (.f64 (.f64 y z) z))
▶	52.4%	#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))

Compiler

Compiled 15 to 15 computations (0% saved)

series5.0ms (0.3%)

Memory

13.0MiB live, 13.0MiB allocated; 0ms collecting garbage

Counts

5 → 11

Calls

Call 1

Inputs
#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))
(.f64 (.f64 y z) z)
(*.f64 y z)
y
z

Outputs
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (pow z 2))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (+ x (* y (pow z 2)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 x))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* x (+ 1 (/ (* y (pow z 2)) x)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* x (- (* -1 (/ (* y (pow z 2)) x)) 1)))))
#s(approx (* y z) #s(hole binary64 (* y z)))
#s(approx y #s(hole binary64 y))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (+ (/ x y) (pow z 2)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* y (+ (* -1 (/ x y)) (* -1 (pow z 2)))))))
#s(approx z #s(hole binary64 z))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* (pow z 2) (+ y (/ x (pow z 2))))))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	y	@	-inf	((+ x (* (* y z) z)) (* (* y z) z) (* y z) y z)
1.0ms	z	@	-inf	((+ x (* (* y z) z)) (* (* y z) z) (* y z) y z)
1.0ms	z	@	inf	((+ x (* (* y z) z)) (* (* y z) z) (* y z) y z)
1.0ms	y	@	inf	((+ x (* (* y z) z)) (* (* y z) z) (* y z) y z)
0.0ms	y	@	0	((+ x (* (* y z) z)) (* (* y z) z) (* y z) y z)

rewrite234.0ms (16.2%)

Memory

-2.8MiB live, 191.1MiB allocated; 70ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	44	174
0	47	156
1	257	156
2	1555	152

Stop Event

1×	iter-limit
1×	unsound
1×	node-limit
1×	iter-limit

Counts

16 → 10

Calls

Call 1

Inputs
#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))
(.f64 (.f64 y z) z)
(*.f64 y z)
y
z
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (pow z 2))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (+ x (* y (pow z 2)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 x))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* x (+ 1 (/ (* y (pow z 2)) x)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* x (- (* -1 (/ (* y (pow z 2)) x)) 1)))))
#s(approx (* y z) #s(hole binary64 (* y z)))
#s(approx y #s(hole binary64 y))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (+ (/ x y) (pow z 2)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* y (+ (* -1 (/ x y)) (* -1 (pow z 2)))))))
#s(approx z #s(hole binary64 z))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* (pow z 2) (+ y (/ x (pow z 2))))))

Outputs
#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))
(.f64 (.f64 y z) z)
(*.f64 y z)
y
z
#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))
#s(approx (+ x (* (* y z) z)) x)
#s(approx (* y z) (*.f64 y z))
#s(approx y y)
#s(approx z z)

eval0.0ms (0%)

Memory: 0.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 24 to 19 computations (20.8% saved)

prune1.0ms (0.1%)

Memory

1.8MiB live, 1.8MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	3	1	4
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	3	3	6

Accuracy

99.9%

Counts

6 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.9%	(+.f64 x (.f64 (.f64 y z) z))
✓	52.4%	#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))
▶	49.4%	#s(approx (+ x (* (* y z) z)) x)

Compiler

Compiled 22 to 22 computations (0% saved)

series2.0ms (0.2%)

Memory

10.1MiB live, 10.1MiB allocated; 0ms collecting garbage

Counts

2 → 8

Calls

Call 1

Inputs
#s(approx (+ x (* (* y z) z)) x)
x

Outputs
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (pow z 2))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (+ x (* y (pow z 2)))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* x (+ 1 (/ (* y (pow z 2)) x)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* x (- (* -1 (/ (* y (pow z 2)) x)) 1)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (+ (/ x y) (pow z 2)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* y (+ (* -1 (/ x y)) (* -1 (pow z 2)))))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* (pow z 2) (+ y (/ x (pow z 2))))))

Calls

9 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((+ x (* (* y z) z)) x)
0.0ms	x	@	inf	((+ x (* (* y z) z)) x)
0.0ms	y	@	-inf	((+ x (* (* y z) z)) x)
0.0ms	x	@	0	((+ x (* (* y z) z)) x)
0.0ms	z	@	inf	((+ x (* (* y z) z)) x)

rewrite199.0ms (13.7%)

Memory

18.5MiB live, 203.7MiB allocated; 33ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	39	142
0	39	124
1	249	124
2	1547	120

Stop Event

1×	iter-limit
1×	unsound
1×	node-limit
1×	saturated

Counts

10 → 3

Calls

Call 1

Inputs
#s(approx (+ x (* (* y z) z)) x)
x
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (pow z 2))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (+ x (* y (pow z 2)))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* x (+ 1 (/ (* y (pow z 2)) x)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* x (- (* -1 (/ (* y (pow z 2)) x)) 1)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* y (+ (/ x y) (pow z 2)))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* -1 (* y (+ (* -1 (/ x y)) (* -1 (pow z 2)))))))
#s(approx (+ x (* (* y z) z)) #s(hole binary64 (* (pow z 2) (+ y (/ x (pow z 2))))))

Outputs
#s(approx (+ x (* (* y z) z)) x)
x
#s(approx x x)

eval0.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 8 to 8 computations (0% saved)

prune5.0ms (0.3%)

Memory

-42.6MiB live, 3.4MiB allocated; 6ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	1	0	1
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	1	3	4

Accuracy

99.9%

Counts

4 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.9%	(+.f64 x (.f64 (.f64 y z) z))
✓	52.4%	#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))
✓	49.4%	#s(approx (+ x (* (* y z) z)) x)

Compiler

Compiled 38 to 33 computations (13.2% saved)

regimes8.0ms (0.6%)

Memory

26.8MiB live, 26.8MiB allocated; 0ms collecting garbage

Counts

3 → 1

Calls

Call 1

Inputs
#s(approx (+ x (* (* y z) z)) x)
#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))
(+.f64 x (.f64 (.f64 y z) z))

Outputs
(+.f64 x (.f64 (.f64 y z) z))

Calls

5 calls:

2.0ms	x
2.0ms	y
2.0ms	z
2.0ms	(.f64 (.f64 y z) z)
1.0ms	(+.f64 x (.f64 (.f64 y z) z))

Results

Accuracy	Segments	Branch
99.9%	1	`(.f64 (.f64 y z) z)`
99.9%	1	`(+.f64 x (.f64 (.f64 y z) z))`
99.9%	1	`x`
99.9%	1	`y`
99.9%	1	`z`

Compiler

Compiled 13 to 20 computations (-53.8% saved)

regimes33.0ms (2.3%)

Memory

6.5MiB live, 62.7MiB allocated; 7ms collecting garbage

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (+ x (* (* y z) z)) x)
#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))

Outputs
#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))
#s(approx (+ x (* (* y z) z)) x)
#s(approx (+ x (* (* y z) z)) (.f64 (.f64 y z) z))

Calls

5 calls:

27.0ms	(.f64 (.f64 y z) z)
1.0ms	x
1.0ms	z
1.0ms	y
1.0ms	(+.f64 x (.f64 (.f64 y z) z))

Results

Accuracy	Segments	Branch
86.5%	3	`(.f64 (.f64 y z) z)`
72.8%	3	`(+.f64 x (.f64 (.f64 y z) z))`
72.1%	3	`x`
62.4%	3	`y`
83.8%	2	`z`

Compiler

Compiled 13 to 20 computations (-53.8% saved)

regimes36.0ms (2.5%)

Memory

-27.4MiB live, 18.7MiB allocated; 6ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (+ x (* (* y z) z)) x)

Outputs
#s(approx (+ x (* (* y z) z)) x)

Calls

5 calls:

32.0ms	z
1.0ms	x
1.0ms	(+.f64 x (.f64 (.f64 y z) z))
1.0ms	y
1.0ms	(.f64 (.f64 y z) z)

Results

Accuracy	Segments	Branch
49.4%	1	`y`
49.4%	1	`x`
49.4%	1	`(+.f64 x (.f64 (.f64 y z) z))`
49.4%	1	`z`
49.4%	1	`(.f64 (.f64 y z) z)`

Compiler

Compiled 13 to 20 computations (-53.8% saved)

bsearch17.0ms (1.1%)

Memory

-11.5MiB live, 34.8MiB allocated; 3ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
7.0ms	1.50077045921119e-52	7.613728959318044e-49
7.0ms	-2658.5278658101297	-0.069329244537798

Samples

6.0ms

256×

valid

Compiler

Compiled 249 to 268 computations (-7.6% saved)

Precisions

Click to see histograms. Total time spent on operations: 1.0ms

ival-add!: 1.0ms (117.7% of total)

adjust: 0.0ms (0% of total)

derivations25.0ms (1.7%)

Memory

1.5MiB live, 47.6MiB allocated; 3ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 22 to 17 computations (22.7% saved)

preprocess78.0ms (5.4%)

Memory: 2.0MiB live, 52.1MiB allocated; 8ms collecting garbage
Remove: (abs z)
Compiler: Compiled 96 to 81 computations (15.6% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample540.0ms (37.3%)

preprocess71.0ms (4.9%)

series8.0ms (0.6%)

rewrite185.0ms (12.8%)

eval1.0ms (0%)

prune1.0ms (0.1%)

series5.0ms (0.3%)

rewrite234.0ms (16.2%)

eval0.0ms (0%)

prune1.0ms (0.1%)

series2.0ms (0.2%)

rewrite199.0ms (13.7%)

eval0.0ms (0%)

prune5.0ms (0.3%)

regimes8.0ms (0.6%)

regimes33.0ms (2.3%)

regimes36.0ms (2.5%)

bsearch17.0ms (1.1%)

derivations25.0ms (1.7%)

preprocess78.0ms (5.4%)

end0.0ms (0%)

Profiling