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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

1.0MiB live, 1.0MiB 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)

sample614.0ms (54.5%)

Memory

5.7MiB live, 768.1MiB allocated; 109ms collecting garbage

Samples

435.0ms

8 256×

valid

Precisions

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

ival-div!: 64.0ms (56.1% of total)

ival-mult!: 49.0ms (43% of total)

adjust: 1.0ms (0.9% of total)

Bogosity

explain59.0ms (5.3%)

Memory

37.2MiB live, 128.3MiB allocated; 7ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`y`
-	-	`#s(literal 2 binary64)`
-	-	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
-	-	`(*.f64 x y)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

25.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult!: 4.0ms (48% of total)

ival-div!: 4.0ms (48% of total)

adjust: 0.0ms (0% of total)

preprocess102.0ms (9.1%)

Memory

-35.6MiB live, 65.0MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	15	32
1	32	32
2	70	30
3	150	30
4	245	30
5	418	30
6	1518	30
7	4830	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.4%)

Memory

12.8MiB live, 12.8MiB 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)

rewrite33.0ms (2.9%)

Memory

22.7MiB live, 69.3MiB allocated; 3ms 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 (neg.f64 x) y) #s(literal 2 binary64)))
(neg.f64 (/.f64 (*.f64 y x) #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)

eval2.0ms (0.2%)

Memory: -44.6MiB live, 2.8MiB allocated; 3ms collecting garbage
Compiler: Compiled 80 to 34 computations (57.5% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	10	2	12
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	11	2	13

Accuracy

100.0%

Counts

13 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 16 to 14 computations (12.5% saved)

series5.0ms (0.4%)

Memory

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

Counts

9 → 7

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
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 y #s(literal 2 binary64))
#s(literal 2 binary64)

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 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx y #s(hole binary64 y))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))

Calls

6 calls:

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

rewrite33.0ms (2.9%)

Memory

10.9MiB live, 61.6MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	24	84
0	29	84
1	47	84
0	85	84

Stop Event

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

Counts

16 → 33

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
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 y #s(literal 2 binary64))
#s(literal 2 binary64)
#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 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx y #s(hole binary64 y))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))

Outputs
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(.f64 (.f64 #s(literal 1/2 binary64) y) x)
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(.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
(*.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 (neg.f64 x) y) #s(literal 2 binary64)))
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64)))
(/.f64 (neg.f64 (neg.f64 y)) #s(literal 2 binary64))
(/.f64 (neg.f64 y) #s(literal -2 binary64))
(/.f64 y #s(literal 2 binary64))
(neg.f64 (/.f64 (neg.f64 y) #s(literal 2 binary64)))
(neg.f64 (/.f64 y #s(literal -2 binary64)))
#s(literal 2 binary64)
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (* y x)) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
#s(approx (* y x) (*.f64 y x))
#s(approx x x)
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
#s(approx y y)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))

eval2.0ms (0.2%)

Memory: 5.6MiB live, 5.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 214 to 72 computations (66.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	23	1	24
Fresh	0	0	0
Picked	2	0	2
Done	0	0	0
Total	25	1	26

Accuracy

100.0%

Counts

26 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 11 to 9 computations (18.2% saved)

series5.0ms (0.5%)

Memory

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

Counts

6 → 5

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite24.0ms (2.1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	57
0	20	57
1	33	57
0	70	57

Stop Event

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

Counts

11 → 19

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 (.f64 #s(literal 1/2 binary64) x) y))
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(*.f64 #s(literal 1/2 binary64) x)
#s(literal 1/2 binary64)
x
y
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* (* 1/2 x) y) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* 1/2 x) #s(hole binary64 (* 1/2 x)))
#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) y) x)
(.f64 (.f64 y #s(literal 1/2 binary64)) x)
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(.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))
(.f64 x (.f64 y #s(literal 1/2 binary64)))
(*.f64 #s(literal 1/2 binary64) x)
(*.f64 x #s(literal 1/2 binary64))
#s(literal 1/2 binary64)
x
y
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (* (* 1/2 x) y) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (* 1/2 x) (*.f64 #s(literal 1/2 binary64) x))
#s(approx x x)
#s(approx y y)

eval1.0ms (0.1%)

Memory: 2.3MiB live, 2.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 146 to 42 computations (71.2% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

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

Accuracy

100.0%

Counts

13 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 43 to 26 computations (39.5% saved)

regimes11.0ms (0.9%)

Memory

-27.8MiB live, 19.5MiB allocated; 2ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

5.0ms	x
2.0ms	y
2.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
2.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)

regimes5.0ms (0.4%)

Memory

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

Accuracy

Total -0.0b remaining (-232.2%)

Threshold costs -0b (-232.2%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

4 calls:

1.0ms	x
1.0ms	y
1.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
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)

derivations4.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 16 to 12 computations (25% saved)

preprocess217.0ms (19.3%)

Memory

-13.5MiB live, 189.6MiB allocated; 85ms collecting garbage

Remove

(sort x y)

(negabs y)

(negabs x)

Compiler

Compiled 158 to 138 computations (12.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample614.0ms (54.5%)

explain59.0ms (5.3%)

preprocess102.0ms (9.1%)

series5.0ms (0.4%)

rewrite33.0ms (2.9%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

series5.0ms (0.4%)

rewrite33.0ms (2.9%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

series5.0ms (0.5%)

rewrite24.0ms (2.1%)

eval1.0ms (0.1%)

prune2.0ms (0.1%)

regimes11.0ms (0.9%)

regimes5.0ms (0.4%)

derivations4.0ms (0.3%)

preprocess217.0ms (19.3%)

end0.0ms (0%)

Profiling