Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307827
details
property
value
status
complete
benchmark
nestrec.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n129.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
3.29761 seconds
cpu usage
9.72141
user time
9.27511
system time
0.446305
max virtual memory
1.8279616E7
max residence set size
1264764.0
stage attributes
key
value
starexec-result
WORST_CASE(NON_POLY, ?)
output
9.55/3.22 WORST_CASE(NON_POLY, ?) 9.55/3.23 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 9.55/3.23 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.55/3.23 9.55/3.23 9.55/3.23 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). 9.55/3.23 9.55/3.23 (0) CpxTRS 9.55/3.23 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 9.55/3.23 (2) CpxTRS 9.55/3.23 (3) SlicingProof [LOWER BOUND(ID), 0 ms] 9.55/3.23 (4) CpxTRS 9.55/3.23 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 9.55/3.23 (6) typed CpxTrs 9.55/3.23 (7) OrderProof [LOWER BOUND(ID), 0 ms] 9.55/3.23 (8) typed CpxTrs 9.55/3.23 (9) RewriteLemmaProof [FINISHED, 750 ms] 9.55/3.23 (10) BOUNDS(EXP, INF) 9.55/3.23 9.55/3.23 9.55/3.23 ---------------------------------------- 9.55/3.23 9.55/3.23 (0) 9.55/3.23 Obligation: 9.55/3.23 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). 9.55/3.23 9.55/3.23 9.55/3.23 The TRS R consists of the following rules: 9.55/3.23 9.55/3.23 f(g(X)) -> g(f(f(X))) 9.55/3.23 f(h(X)) -> h(g(X)) 9.55/3.23 9.55/3.23 S is empty. 9.55/3.23 Rewrite Strategy: FULL 9.55/3.23 ---------------------------------------- 9.55/3.23 9.55/3.23 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 9.55/3.23 Renamed function symbols to avoid clashes with predefined symbol. 9.55/3.23 ---------------------------------------- 9.55/3.23 9.55/3.23 (2) 9.55/3.23 Obligation: 9.55/3.23 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). 9.55/3.23 9.55/3.23 9.55/3.23 The TRS R consists of the following rules: 9.55/3.23 9.55/3.23 f(g(X)) -> g(f(f(X))) 9.55/3.23 f(h(X)) -> h(g(X)) 9.55/3.23 9.55/3.23 S is empty. 9.55/3.23 Rewrite Strategy: FULL 9.55/3.23 ---------------------------------------- 9.55/3.23 9.55/3.23 (3) SlicingProof (LOWER BOUND(ID)) 9.55/3.23 Sliced the following arguments: 9.55/3.23 h/0 9.55/3.23 9.55/3.23 ---------------------------------------- 9.55/3.23 9.55/3.23 (4) 9.55/3.23 Obligation: 9.55/3.23 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). 9.55/3.23 9.55/3.23 9.55/3.23 The TRS R consists of the following rules: 9.55/3.23 9.55/3.23 f(g(X)) -> g(f(f(X))) 9.55/3.23 f(h) -> h 9.55/3.23 9.55/3.23 S is empty. 9.55/3.23 Rewrite Strategy: FULL 9.55/3.23 ---------------------------------------- 9.55/3.23 9.55/3.23 (5) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 9.55/3.23 Infered types. 9.55/3.23 ---------------------------------------- 9.55/3.23 9.55/3.23 (6) 9.55/3.23 Obligation: 9.55/3.23 TRS: 9.55/3.23 Rules: 9.55/3.23 f(g(X)) -> g(f(f(X))) 9.55/3.23 f(h) -> h 9.55/3.23 9.55/3.23 Types: 9.55/3.23 f :: g:h -> g:h 9.55/3.23 g :: g:h -> g:h 9.55/3.23 h :: g:h 9.55/3.23 hole_g:h1_0 :: g:h 9.55/3.23 gen_g:h2_0 :: Nat -> g:h 9.55/3.23 9.55/3.23 ---------------------------------------- 9.55/3.23 9.55/3.23 (7) OrderProof (LOWER BOUND(ID)) 9.55/3.23 Heuristically decided to analyse the following defined symbols: 9.55/3.23 f 9.55/3.23 ---------------------------------------- 9.55/3.23 9.55/3.23 (8)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Full_Rewriting 2019-04-01 06.11