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

Time bar (total: 966.0ms)

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
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
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)

sample551.0ms (57%)

Memory
36.9MiB live, 701.2MiB allocated; 162ms collecting garbage
Samples
338.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 127.0ms
ival-mult!: 88.0ms (69.5% of total)
ival-div!: 38.0ms (30% of total)
adjust: 1.0ms (0.8% of total)
Bogosity

preprocess260.0ms (26.9%)

Memory
-25.3MiB live, 69.7MiB allocated; 15ms collecting garbage
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
01532
14030
28130
314230
424830
5108030
6488930
Stop Event
node-limit
Alt Table
Click to see full alt table
StatusAccuracyProgram
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.5%)

Memory
12.2MiB live, 12.2MiB 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:

TimeVariablePointExpression
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)

rewrite29.0ms (3%)

Memory
-3.4MiB live, 41.6MiB allocated; 8ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01335
01435
12635
06435
Stop Event
iter-limit
iter-limit
iter-limit
unsound
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.7MiB live, 2.7MiB allocated; 0ms collecting garbage
Compiler

Compiled 45 to 34 computations (24.4% saved)

prune1.0ms (0.1%)

Memory
2.1MiB live, 2.1MiB allocated; 0ms collecting garbage
Pruning

2 alts after pruning (2 fresh and 0 done)

PrunedKeptTotal
New11213
Fresh000
Picked101
Done000
Total12214
Accuracy
100.0%
Counts
14 → 2
Alt Table
Click to see full alt table
StatusAccuracyProgram
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 14 to 14 computations (0% saved)

series5.0ms (0.5%)

Memory
10.5MiB live, 10.5MiB allocated; 0ms collecting garbage
Counts
9 → 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
(*.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 (* y x) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))
Calls

6 calls:

TimeVariablePointExpression
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)
0.0ms
y
@0
((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2)

rewrite27.0ms (2.7%)

Memory
-13.8MiB live, 30.9MiB allocated; 9ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02062
02462
14162
07962
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
14 → 31
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 (* y x) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 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
(*.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 (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 y #s(literal -2 binary64)))
(neg.f64 (/.f64 (neg.f64 y) #s(literal 2 binary64)))
#s(literal 2 binary64)
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x)))
#s(approx (* y x) (*.f64 y x))
#s(approx x x)
#s(approx y y)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))

eval2.0ms (0.2%)

Memory
4.8MiB live, 4.8MiB allocated; 0ms collecting garbage
Compiler

Compiled 83 to 68 computations (18.1% saved)

prune1.0ms (0.1%)

Memory
3.2MiB live, 3.2MiB allocated; 0ms collecting garbage
Pruning

1 alts after pruning (1 fresh and 0 done)

PrunedKeptTotal
New22123
Fresh000
Picked202
Done000
Total24125
Accuracy
100.0%
Counts
25 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x)
Compiler

Compiled 8 to 8 computations (0% saved)

series3.0ms (0.3%)

Memory
6.8MiB live, 6.8MiB allocated; 0ms collecting garbage
Counts
6 → 4
Calls
Call 1
Inputs
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
#s(literal 1/2 binary64)
y
x
Outputs
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx x #s(hole binary64 x))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))
#s(approx y #s(hole binary64 y))
Calls

6 calls:

TimeVariablePointExpression
1.0ms
y
@-inf
((* (/ y 2) x) (/ y 2) (* 1/2 y) 1/2 y x)
1.0ms
y
@inf
((* (/ y 2) x) (/ y 2) (* 1/2 y) 1/2 y x)
0.0ms
x
@-inf
((* (/ y 2) x) (/ y 2) (* 1/2 y) 1/2 y x)
0.0ms
x
@inf
((* (/ y 2) x) (/ y 2) (* 1/2 y) 1/2 y x)
0.0ms
y
@0
((* (/ y 2) x) (/ y 2) (* 1/2 y) 1/2 y x)

rewrite32.0ms (3.3%)

Memory
-12.6MiB live, 38.4MiB allocated; 13ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01646
01746
13246
06646
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
10 → 12
Calls
Call 1
Inputs
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
#s(literal 1/2 binary64)
y
x
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx x #s(hole binary64 x))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))
#s(approx y #s(hole binary64 y))
Outputs
(*.f64 x #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)))
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
(*.f64 y #s(literal 1/2 binary64))
#s(literal 1/2 binary64)
y
x
#s(approx (* (/ y 2) x) (*.f64 (*.f64 x y) #s(literal 1/2 binary64)))
#s(approx x x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
#s(approx y y)

eval0.0ms (0.1%)

Memory
1.2MiB live, 1.2MiB allocated; 0ms collecting garbage
Compiler

Compiled 25 to 21 computations (16% saved)

prune1.0ms (0.1%)

Memory
3.1MiB live, 3.1MiB allocated; 0ms collecting garbage
Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New505
Fresh000
Picked011
Done000
Total516
Accuracy
100.0%
Counts
6 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x)
Compiler

Compiled 26 to 26 computations (0% saved)

regimes7.0ms (0.7%)

Memory
17.6MiB live, 17.6MiB allocated; 0ms collecting garbage
Counts
4 → 1
Calls
Call 1
Inputs
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x)))
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x)
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 (*.f64 x y) #s(literal 2 binary64))
Outputs
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x)
Calls

4 calls:

2.0ms
y
2.0ms
(/.f64 (*.f64 x y) #s(literal 2 binary64))
2.0ms
x
2.0ms
(*.f64 x y)
Results
AccuracySegmentsBranch
100.0%1(*.f64 x y)
100.0%1(/.f64 (*.f64 x y) #s(literal 2 binary64))
100.0%1x
100.0%1y
Compiler

Compiled 10 to 12 computations (-20% saved)

regimes6.0ms (0.6%)

Memory
-34.5MiB live, 12.3MiB allocated; 2ms collecting garbage
Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts
1 → 1
Calls
Call 1
Inputs
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x)))
Outputs
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x)))
Calls

4 calls:

3.0ms
(/.f64 (*.f64 x y) #s(literal 2 binary64))
1.0ms
(*.f64 x y)
1.0ms
y
1.0ms
x
Results
AccuracySegmentsBranch
100.0%1(*.f64 x y)
100.0%1(/.f64 (*.f64 x y) #s(literal 2 binary64))
100.0%1x
100.0%1y
Compiler

Compiled 10 to 12 computations (-20% saved)

derivations2.0ms (0.3%)

Memory
4.1MiB live, 4.1MiB allocated; 0ms collecting garbage
Stop Event
done
Compiler

Compiled 13 to 13 computations (0% saved)

preprocess33.0ms (3.4%)

Memory
26.9MiB live, 73.0MiB allocated; 6ms collecting garbage
Remove

(sort x y)

(negabs y)

(negabs x)

Compiler

Compiled 120 to 120 computations (0% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...