Metrics for Numeric.Interval.Internal:scale from intervals-0.7.1, B

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB 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 7 to 7 computations (0% saved)

sample570.0ms (63.4%)

Memory

7.5MiB live, 914.1MiB allocated; 224ms collecting garbage

Samples

369.0ms

8 256×

valid

Precisions

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

ival-mult!: 51.0ms (53.5% of total)

ival-div!: 43.0ms (45.1% of total)

adjust: 2.0ms (2.1% of total)

Bogosity

preprocess240.0ms (26.7%)

Memory

-8.3MiB live, 37.7MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	15	32
1	40	30
2	81	30
3	142	30
4	248	30
5	1080	30
6	4889	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Symmetry

(negabs x)

(negabs y)

(sort x y)

Compiler

Compiled 10 to 10 computations (0% saved)

series5.0ms (0.6%)

Memory

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

Counts

5 → 4

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(*.f64 x y)
x
y
#s(literal 2 binary64)

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((/ (* x y) 2) (* x y) x y 2)
1.0ms	x	@	inf	((/ (* x y) 2) (* x y) x y 2)
1.0ms	y	@	-inf	((/ (* x y) 2) (* x y) x y 2)
1.0ms	y	@	inf	((/ (* x y) 2) (* x y) x y 2)
1.0ms	x	@	0	((/ (* x y) 2) (* x y) x y 2)

rewrite31.0ms (3.5%)

Memory

3.8MiB live, 54.9MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	35
0	14	35
1	26	35
0	64	35

Stop Event

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

Counts

9 → 17

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(*.f64 x y)
x
y
#s(literal 2 binary64)
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Outputs
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(*.f64 y (/.f64 x #s(literal 2 binary64)))
(*.f64 x (/.f64 y #s(literal 2 binary64)))
(/.f64 (neg.f64 (*.f64 (neg.f64 x) y)) #s(literal 2 binary64))
(/.f64 (*.f64 (neg.f64 x) y) #s(literal -2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64)))
(neg.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)))
(*.f64 y x)
(*.f64 x y)
x
y
#s(literal 2 binary64)
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (* x y) (*.f64 y x))
#s(approx x x)
#s(approx y y)

eval1.0ms (0.1%)

Memory: 2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 45 to 34 computations (24.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	12	1	13
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	13	1	14

Accuracy

100.0%

Counts

14 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Compiler

Compiled 9 to 9 computations (0% saved)

series4.0ms (0.4%)

Memory

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

Counts

6 → 5

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
#s(literal 1/2 binary64)
(*.f64 y x)
y
x

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	-inf	((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x)
1.0ms	x	@	-inf	((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x)
1.0ms	x	@	inf	((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x)
0.0ms	y	@	inf	((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x)
0.0ms	x	@	0	((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x)

rewrite21.0ms (2.3%)

Memory

-14.2MiB live, 32.1MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	57
0	20	57
1	36	57
0	73	57

Stop Event

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

Counts

11 → 17

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
#s(literal 1/2 binary64)
(*.f64 y x)
y
x
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Outputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(.f64 (.f64 #s(literal 1/2 binary64) y) x)
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(.f64 y (.f64 #s(literal 1/2 binary64) x))
(.f64 x (.f64 #s(literal 1/2 binary64) y))
#s(literal 1/2 binary64)
(*.f64 y x)
(*.f64 x y)
y
x
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (* 1/2 (* y x)) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (* y x) (*.f64 y x))
#s(approx x x)
#s(approx y y)

eval1.0ms (0.1%)

Memory: 2.7MiB live, 2.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 44 to 39 computations (11.4% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	10	0	10
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	10	1	11

Accuracy

100.0%

Counts

11 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Compiler

Compiled 21 to 21 computations (0% saved)

regimes5.0ms (0.6%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(/.f64 (*.f64 x y) #s(literal 2 binary64))

Outputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Calls

4 calls:

1.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
1.0ms	y
1.0ms	x
1.0ms	(*.f64 x y)

Results

Accuracy	Segments	Branch
100.0%	1	`(*.f64 x y)`
100.0%	1	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 9 to 9 computations (0% saved)

preprocess19.0ms (2.1%)

Memory

-9.9MiB live, 37.1MiB allocated; 2ms collecting garbage

Remove

(sort x y)

(negabs y)

(negabs x)

Compiler

Compiled 68 to 68 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample570.0ms (63.4%)

preprocess240.0ms (26.7%)

series5.0ms (0.6%)

rewrite31.0ms (3.5%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series4.0ms (0.4%)

rewrite21.0ms (2.3%)

eval1.0ms (0.1%)

prune1.0ms (0.2%)

regimes5.0ms (0.6%)

derivations1.0ms (0.1%)

preprocess19.0ms (2.1%)

end0.0ms (0%)

Profiling