Data.Random.Distribution.Normal:doubleStdNormalZ from random-fu-0.2.6.2

Time bar (total: 5.6s)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory
0.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
100%100%0%0%0%0%0%1
Compiler

Compiled 7 to 6 computations (14.3% saved)

sample680.0ms (12.2%)

Memory
-12.9MiB live, 665.6MiB allocated; 178ms collecting garbage
Samples
405.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 109.0ms
ival-add: 53.0ms (48.7% of total)
ival-sub: 39.0ms (35.8% of total)
ival-true: 5.0ms (4.6% of total)
exact: 5.0ms (4.6% of total)
adjust: 3.0ms (2.8% of total)
ival-assert: 3.0ms (2.8% of total)
Bogosity

explain123.0ms (2.2%)

Memory
-16.1MiB live, 119.9MiB allocated; 94ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(+.f64 x x)
00-0-#s(literal 1 binary64)
00-0-(-.f64 (+.f64 x x) #s(literal 1 binary64))
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
17.0ms512×0valid
Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 6.0ms
ival-sub: 3.0ms (47.6% of total)
ival-add: 3.0ms (47.6% 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)

preprocess13.0ms (0.2%)

Memory
23.1MiB live, 23.1MiB allocated; 0ms collecting garbage
Algorithm
1×egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0613
11413
22211
33211
43611
53811
045
065
1125
2155
3175
0175
Stop Event
1×iter limit
1×saturated
1×iter limit
1×saturated
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

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

Compiled 0 to 1 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 x) #s(literal 1 binary64))
Compiler

Compiled 5 to 4 computations (20% saved)

simplify3.0ms (0.1%)

Memory
5.2MiB live, 5.2MiB allocated; 0ms collecting garbage
Algorithm
1×egg-herbie
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
cost-diff0
(+.f64 x x)
cost-diff0
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0410
0610
11210
21510
31710
01710
Stop Event
1×iter limit
1×saturated
1×iter limit
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(+.f64 x x)
(*.f64 #s(literal 2 binary64) x)
x
#s(literal 1 binary64)

localize39.0ms (0.7%)

Memory
-3.6MiB live, 28.9MiB allocated; 29ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
accuracy0.0
(-.f64 (+.f64 x x) #s(literal 1 binary64))
accuracy0.0
(+.f64 x x)
Samples
35.0ms256×0valid
Compiler

Compiled 12 to 6 computations (50% saved)

Precisions
Click to see histograms. Total time spent on operations: 30.0ms
ival-sub: 27.0ms (90.7% of total)
ival-add: 2.0ms (6.7% 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)

series2.0ms (0%)

Memory
6.2MiB live, 6.2MiB allocated; 0ms collecting garbage
Counts
2 → 5
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Calls

3 calls:

TimeVariablePointExpression
1.0ms
x
@inf
((- (+ x x) 1) (+ x x))
0.0ms
x
@-inf
((- (+ x x) 1) (+ x x))
0.0ms
x
@0
((- (+ x x) 1) (+ x x))

simplify4.0ms (0.1%)

Memory
11.5MiB live, 11.5MiB allocated; 0ms collecting garbage
Algorithm
1×egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01224
12324
23724
33924
44124
04124
Stop Event
1×iter limit
1×saturated
Counts
5 → 5
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(*.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)) x)
(* -1 (* x (- (/ 1 x) 2)))
(*.f64 (neg.f64 x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64)))

rewrite4.2s (75%)

Memory
-396.7MiB live, 133.8MiB allocated; 5.2s collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
048
068
1348
02908
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
2 → 47
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
Outputs
(*.f64 (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)) (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)))
(/.f64 (-.f64 (*.f64 x x) (*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))) (-.f64 x (-.f64 x #s(literal 1 binary64))))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (-.f64 x #s(literal 1 binary64)) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (*.f64 x (-.f64 x #s(literal 1 binary64))))))
(/.f64 (neg.f64 (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(/.f64 (neg.f64 (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))))
(/.f64 (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))
(/.f64 (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(expm1.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(-.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(-.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(+.f64 (-.f64 x #s(literal 1 binary64)) x)
(+.f64 x (-.f64 x #s(literal 1 binary64)))
(*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(*.f64 (neg.f64 (*.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 (fabs.f64 (*.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(exp.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(+.f64 (*.f64 x (*.f64 #s(literal 2 binary64) x)) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(+.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) x) (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)

eval6.0ms (0.1%)

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

Compiled 589 to 151 computations (74.4% saved)

prune14.0ms (0.3%)

Memory
-32.5MiB live, 12.2MiB allocated; 13ms collecting garbage
Pruning

2 alts after pruning (1 fresh and 1 done)

PrunedKeptTotal
New51152
Fresh000
Picked011
Done000
Total51253
Accuracy
100.0%
Counts
53 → 2
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶54.2%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 12 to 10 computations (16.7% saved)

simplify4.0ms (0.1%)

Memory
9.2MiB live, 9.2MiB allocated; 0ms collecting garbage
Algorithm
1×egg-herbie
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
cost-diff0
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
068
068
1128
2158
3178
0178
Stop Event
1×iter limit
1×saturated
1×saturated
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)

localize11.0ms (0.2%)

Memory
23.4MiB live, 23.4MiB allocated; 0ms collecting garbage
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
accuracy29.28703599823418
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Samples
7.0ms256×0valid
Compiler

Compiled 8 to 7 computations (12.5% saved)

Precisions
Click to see histograms. Total time spent on operations: 3.0ms
ival-sub: 1.0ms (33.4% of total)
ival-add: 1.0ms (33.4% 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)

series1.0ms (0%)

Memory
1.1MiB live, 1.1MiB allocated; 0ms collecting garbage
Counts
1 → 5
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Calls

3 calls:

TimeVariablePointExpression
0.0ms
x
@inf
((- (+ x x) 1))
0.0ms
x
@-inf
((- (+ x x) 1))
0.0ms
x
@0
((- (+ x x) 1))

simplify20.0ms (0.4%)

Memory
-37.2MiB live, 8.1MiB allocated; 5ms collecting garbage
Algorithm
1×egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01224
12324
23724
33924
44124
04124
Stop Event
1×iter limit
1×saturated
Counts
5 → 5
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(*.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)) x)
(* -1 (* x (- (/ 1 x) 2)))
(*.f64 (neg.f64 x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64)))

rewrite51.0ms (0.9%)

Memory
39.9MiB live, 83.9MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
067
067
1347
02907
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×saturated
Counts
1 → 1
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

eval1.0ms (0%)

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

Compiled 54 to 20 computations (63% saved)

prune1.0ms (0%)

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

3 alts after pruning (1 fresh and 2 done)

PrunedKeptTotal
New415
Fresh000
Picked011
Done011
Total437
Accuracy
100.0%
Counts
7 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶47.7%
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
✓54.2%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 21 to 17 computations (19% saved)

simplify23.0ms (0.4%)

Memory
-41.0MiB live, 11.2MiB allocated; 22ms collecting garbage
Algorithm
1×egg-herbie
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
cost-diff0
(*.f64 #s(literal 2 binary64) x)
cost-diff0
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0714
0814
11514
21614
31814
01814
Stop Event
1×iter limit
1×saturated
1×iter limit
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x
Outputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x

localize21.0ms (0.4%)

Memory
14.0MiB live, 62.5MiB allocated; 4ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
accuracy0.0
(*.f64 #s(literal 2 binary64) x)
accuracy33.46824390922263
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
Samples
16.0ms256×0valid
Compiler

Compiled 12 to 8 computations (33.3% saved)

Precisions
Click to see histograms. Total time spent on operations: 9.0ms
ival-add: 5.0ms (58.6% of total)
ival-mult: 2.0ms (23.4% of total)
ival-sub: 1.0ms (11.7% 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)

series1.0ms (0%)

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

3 calls:

TimeVariablePointExpression
0.0ms
x
@-inf
((- (+ x x) 1) (* 2 x))
0.0ms
x
@inf
((- (+ x x) 1) (* 2 x))
0.0ms
x
@0
((- (+ x x) 1) (* 2 x))

simplify4.0ms (0.1%)

Memory
11.9MiB live, 11.9MiB allocated; 0ms collecting garbage
Algorithm
1×egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01224
12324
23724
33924
44124
04124
Stop Event
1×iter limit
1×saturated
Counts
5 → 5
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(*.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)) x)
(* -1 (* x (- (/ 1 x) 2)))
(*.f64 (neg.f64 x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64)))

rewrite41.0ms (0.7%)

Memory
-29.2MiB live, 62.9MiB allocated; 6ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0712
0812
13712
029712
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
2 → 39
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
Outputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) x) #s(literal 2 binary64))
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(*.f64 (neg.f64 (*.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 (fabs.f64 (*.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(*.f64 (*.f64 x x) #s(literal 4 binary64))
(*.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 8 binary64))
(*.f64 #s(literal 2 binary64) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(*.f64 x (*.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) x)))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(exp.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(+.f64 (*.f64 x (*.f64 #s(literal 2 binary64) x)) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(+.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) x) (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)

eval4.0ms (0.1%)

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

Compiled 625 to 133 computations (78.7% saved)

prune2.0ms (0%)

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

3 alts after pruning (1 fresh and 2 done)

PrunedKeptTotal
New43144
Fresh000
Picked101
Done022
Total44347
Accuracy
100.0%
Counts
47 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶47.7%
#s(approx (- (+ x x) 1) (+.f64 x x))
✓54.2%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 21 to 16 computations (23.8% saved)

simplify4.0ms (0.1%)

Memory
7.7MiB live, 7.7MiB allocated; 0ms collecting garbage
Algorithm
1×egg-herbie
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
cost-diff0
(+.f64 x x)
cost-diff0
#s(approx (- (+ x x) 1) (+.f64 x x))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0613
0713
11313
21613
31813
01813
Stop Event
1×iter limit
1×saturated
1×iter limit
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x
Outputs
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(+.f64 x x)
(*.f64 #s(literal 2 binary64) x)
x

localize17.0ms (0.3%)

Memory
-20.7MiB live, 31.6MiB allocated; 5ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
accuracy0.0
(+.f64 x x)
accuracy33.46824390922263
#s(approx (- (+ x x) 1) (+.f64 x x))
Samples
13.0ms256×0valid
Compiler

Compiled 11 to 6 computations (45.5% saved)

Precisions
Click to see histograms. Total time spent on operations: 5.0ms
ival-sub: 4.0ms (73.1% of total)
ival-add: 1.0ms (18.3% 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)

series1.0ms (0%)

Memory
1.8MiB live, 1.8MiB allocated; 0ms collecting garbage
Counts
2 → 5
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Calls

3 calls:

TimeVariablePointExpression
0.0ms
x
@inf
((- (+ x x) 1) (+ x x))
0.0ms
x
@-inf
((- (+ x x) 1) (+ x x))
0.0ms
x
@0
((- (+ x x) 1) (+ x x))

simplify4.0ms (0.1%)

Memory
6.3MiB live, 6.3MiB allocated; 0ms collecting garbage
Algorithm
1×egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01224
12324
23724
33924
44124
04124
Stop Event
1×iter limit
1×saturated
Counts
5 → 5
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(*.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)) x)
(* -1 (* x (- (/ 1 x) 2)))
(*.f64 (neg.f64 x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64)))

rewrite45.0ms (0.8%)

Memory
-3.4MiB live, 43.0MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0612
0712
13512
029112
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
2 → 35
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
Outputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(*.f64 (neg.f64 (*.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 (fabs.f64 (*.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(exp.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(+.f64 (*.f64 x (*.f64 #s(literal 2 binary64) x)) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(+.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) x) (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)

eval4.0ms (0.1%)

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

Compiled 577 to 122 computations (78.9% saved)

prune3.0ms (0%)

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

3 alts after pruning (0 fresh and 3 done)

PrunedKeptTotal
New40040
Fresh000
Picked011
Done022
Total40343
Accuracy
100.0%
Counts
43 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓47.7%
#s(approx (- (+ x x) 1) (+.f64 x x))
✓54.2%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 51 to 29 computations (43.1% saved)

regimes5.0ms (0.1%)

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

3 calls:

2.0ms
x
2.0ms
(+.f64 x x)
2.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
100.0%1(+.f64 x x)
100.0%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
100.0%1x
Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes29.0ms (0.5%)

Memory
-30.2MiB live, 16.7MiB allocated; 3ms collecting garbage
Counts
3 → 3
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
Outputs
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
Calls

3 calls:

24.0ms
x
3.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
1.0ms
(+.f64 x x)
Results
AccuracySegmentsBranch
98.4%3(+.f64 x x)
98.4%3(-.f64 (+.f64 x x) #s(literal 1 binary64))
98.4%3x
Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.1%)

Memory
10.6MiB live, 10.6MiB allocated; 0ms collecting garbage
Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts
1 → 1
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Calls

3 calls:

1.0ms
x
1.0ms
(+.f64 x x)
1.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
54.2%1(+.f64 x x)
54.2%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
54.2%1x
Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch25.0ms (0.4%)

Memory
4.6MiB live, 49.3MiB allocated; 5ms collecting garbage
Algorithm
2×binary-search
Stop Event
1×narrow-enough
1×narrow-enough
Steps
TimeLeftRight
13.0ms
0.0011941623377177601
374538.72953674983
9.0ms
-1125.7824294275438
-5.627203128924076e-7
Samples
9.0ms288×0valid
Compiler

Compiled 296 to 260 computations (12.2% saved)

Precisions
Click to see histograms. Total time spent on operations: 3.0ms
ival-add: 2.0ms (60.6% of total)
ival-sub: 1.0ms (30.3% 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)

simplify77.0ms (1.4%)

Memory
-17.9MiB live, 25.2MiB allocated; 72ms collecting garbage
Algorithm
1×egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01537
12637
23237
34237
45637
58237
613037
724837
848637
955037
1058937
1160537
1261737
1367737
1468637
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 x #s(literal -1/2 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 x #s(literal 1/2 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 x #s(literal -1/2 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 x #s(literal 1/2 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))
(if (or (<=.f64 x #s(literal -1/2 binary64)) (not (<=.f64 x #s(literal 1/2 binary64)))) #s(approx (- (+ x x) 1) (+.f64 x x)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

derivations51.0ms (0.9%)

Memory
30.2MiB live, 79.6MiB allocated; 11ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0712
0812
13712
029712
01224
12324
23724
33924
44124
04124
01224
12324
23724
33924
44124
04124
Stop Event
1×done
1×iter limit
1×saturated
1×iter limit
1×saturated
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Compiler

Compiled 37 to 17 computations (54.1% saved)

preprocess53.0ms (1%)

Memory
4.6MiB live, 51.2MiB allocated; 2ms collecting garbage
Compiler

Compiled 84 to 42 computations (50% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...