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

Time bar (total: 993.0ms)

start0.0ms (0%)

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

analyze0.0ms (0%)

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

sample594.0ms (59.8%)

Memory
-13.4MiB live, 858.1MiB allocated; 285ms collecting garbage
Samples
421.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 139.0ms
ival-div!: 71.0ms (51.2% of total)
ival-mult!: 66.0ms (47.6% of total)
adjust: 1.0ms (0.7% of total)
Bogosity

preprocess257.0ms (25.9%)

Memory
-31.5MiB live, 66.0MiB allocated; 35ms 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
6.8MiB live, 6.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:

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
@0
((/ (* x y) 2) (* x y) x y 2)
1.0ms
y
@inf
((/ (* x y) 2) (* x y) x y 2)

rewrite22.0ms (2.3%)

Memory
26.4MiB live, 26.4MiB allocated; 0ms 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.0MiB live, 2.0MiB allocated; 0ms collecting garbage
Compiler

Compiled 85 to 34 computations (60% saved)

prune1.0ms (0.1%)

Memory
1.6MiB live, 1.6MiB 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 16 to 14 computations (12.5% saved)

series8.0ms (0.8%)

Memory
-34.9MiB live, 10.2MiB allocated; 5ms 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
5.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
@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)

rewrite19.0ms (1.9%)

Memory
22.9MiB live, 22.9MiB allocated; 0ms 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.0MiB live, 4.0MiB allocated; 0ms collecting garbage
Compiler

Compiled 197 to 68 computations (65.5% saved)

prune1.0ms (0.1%)

Memory
2.7MiB live, 2.7MiB 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 9 to 8 computations (11.1% saved)

series3.0ms (0.3%)

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

rewrite25.0ms (2.5%)

Memory
-26.4MiB live, 18.1MiB allocated; 7ms 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)

eval1.0ms (0.1%)

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

Compiled 51 to 21 computations (58.8% saved)

prune1.0ms (0.1%)

Memory
1.8MiB live, 1.8MiB 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 39 to 26 computations (33.3% saved)

regimes6.0ms (0.6%)

Memory
10.2MiB live, 10.2MiB 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
x
1.0ms
(/.f64 (*.f64 x y) #s(literal 2 binary64))
1.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)

regimes4.0ms (0.4%)

Memory
7.7MiB live, 7.7MiB allocated; 0ms 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:

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

derivations2.0ms (0.2%)

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

Compiled 20 to 13 computations (35% saved)

preprocess40.0ms (4%)

Memory
-4.7MiB live, 46.6MiB allocated; 10ms collecting garbage
Remove

(sort x y)

(negabs y)

(negabs x)

Compiler

Compiled 145 to 120 computations (17.2% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...