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

Time bar (total: 1.1s)

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)

sample587.0ms (51.7%)

Memory
61.4MiB live, 566.2MiB allocated; 72ms collecting garbage
Samples
376.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 197.0ms
ival-div: 111.0ms (56.3% of total)
ival-mult: 77.0ms (39.1% of total)
exact: 5.0ms (2.5% of total)
adjust: 2.0ms (1% of total)
ival-assert: 2.0ms (1% of total)
Bogosity

explain62.0ms (5.4%)

Memory
-14.2MiB live, 79.1MiB allocated; 26ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-y
00-0-#s(literal 2 binary64)
00-0-(/.f64 (*.f64 x y) #s(literal 2 binary64))
00-0-(*.f64 x y)
00-0-x
Confusion
Predicted +Predicted -
+00
-0256
Precision
0/0
Recall
0/0
Confusion?
Predicted +Predicted MaybePredicted -
+000
-00256
Precision?
0/0
Recall?
0/0
Freqs
test
numberfreq
0256
Total Confusion?
Predicted +Predicted MaybePredicted -
+000
-001
Precision?
0/0
Recall?
0/0
Samples
25.0ms512×0valid
Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions
Click to see histograms. Total time spent on operations: 9.0ms
ival-mult: 4.0ms (46.8% of total)
ival-div: 3.0ms (35.1% of total)
ival-true: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

preprocess254.0ms (22.4%)

Memory
-11.3MiB live, 189.9MiB allocated; 53ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01532
13232
27030
315030
424530
541830
6151830
7483030
055
075
1125
2185
3315
4595
51635
610405
755035
084105
Stop Event
iter limit
node limit
iter limit
node limit
Calls
Call 1
Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
Outputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
Symmetry

(negabs x)

(negabs y)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory
1.0MiB live, 1.0MiB allocated; 0ms collecting garbage
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(/.f64 (*.f64 x y) #s(literal 2 binary64))
Compiler

Compiled 5 to 5 computations (0% saved)

series5.0ms (0.5%)

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

rewrite28.0ms (2.4%)

Memory
-0.7MiB live, 45.6MiB allocated; 3ms 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 (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.1%)

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

Compiled 105 to 36 computations (65.7% saved)

prune1.0ms (0.1%)

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

2 alts after pruning (2 fresh and 0 done)

PrunedKeptTotal
New15217
Fresh000
Picked101
Done000
Total16218
Accuracy
100.0%
Counts
18 → 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)

series9.0ms (0.8%)

Memory
-30.7MiB live, 15.9MiB allocated; 5ms 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:

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

rewrite20.0ms (1.7%)

Memory
24.6MiB live, 24.6MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02484
02984
14784
08584
Stop Event
iter limit
iter limit
iter limit
unsound
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))

eval3.0ms (0.3%)

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

Compiled 305 to 75 computations (75.4% saved)

prune5.0ms (0.4%)

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

1 alts after pruning (1 fresh and 0 done)

PrunedKeptTotal
New34135
Fresh000
Picked202
Done000
Total36137
Accuracy
100.0%
Counts
37 → 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)

series19.0ms (1.6%)

Memory
-32.0MiB live, 19.2MiB allocated; 7ms collecting garbage
Counts
6 → 5
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 (* 1/2 y) #s(hole binary64 (* 1/2 y)))
#s(approx y #s(hole binary64 y))
Calls

6 calls:

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

rewrite21.0ms (1.8%)

Memory
-15.7MiB live, 30.7MiB allocated; 3ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01753
01853
13353
06753
Stop Event
iter limit
iter limit
iter limit
unsound
iter limit
Counts
11 → 13
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 (* 1/2 y) #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 (* 1/2 y) (*.f64 #s(literal 1/2 binary64) y))
#s(approx y y)

eval3.0ms (0.3%)

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

Compiled 118 to 27 computations (77.1% saved)

prune2.0ms (0.2%)

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

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New12012
Fresh000
Picked011
Done000
Total12113
Accuracy
100.0%
Counts
13 → 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)

regimes7.0ms (0.6%)

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

regimes4.0ms (0.4%)

Memory
14.0MiB live, 14.0MiB 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
x
1.0ms
y
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)

simplify67.0ms (5.9%)

Memory
2.5MiB live, 49.4MiB allocated; 3ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01320
11720
22320
33720
47720
541520
6362720
Stop Event
node limit
Calls
Call 1
Inputs
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x)))
Outputs
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x)))

derivations2.0ms (0.2%)

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

Compiled 20 to 13 computations (35% saved)

preprocess34.0ms (3%)

Memory
-39.1MiB live, 53.4MiB allocated; 12ms collecting garbage
Remove

(sort x y)

(negabs y)

(negabs x)

Compiler

Compiled 104 to 84 computations (19.2% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...