details

property	value
status	complete
benchmark	TreeMap.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n174.star.cs.uiowa.edu
space	Applicative_05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.73019 seconds
cpu usage	3.89616
user time	3.74674
system time	0.149421
max virtual memory	1.8343148E7
max residence set size	238116.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) Overlay + Local Confluence [EQUIVALENT, 2 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(app(map, f), nil) -> nil app(app(map, f), app(app(cons, x), xs)) -> app(app(cons, app(f, x)), app(app(map, f), xs)) app(app(treemap, f), app(app(node, x), xs)) -> app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs)) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(app(map, f), nil) -> nil app(app(map, f), app(app(cons, x), xs)) -> app(app(cons, app(f, x)), app(app(map, f), xs)) app(app(treemap, f), app(app(node, x), xs)) -> app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs)) The set Q consists of the following terms: app(app(map, x0), nil) app(app(map, x0), app(app(cons, x1), x2)) app(app(treemap, x0), app(app(node, x1), x2)) ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: APP(app(map, f), app(app(cons, x), xs)) -> APP(app(cons, app(f, x)), app(app(map, f), xs)) APP(app(map, f), app(app(cons, x), xs)) -> APP(cons, app(f, x)) APP(app(map, f), app(app(cons, x), xs)) -> APP(f, x) APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs) APP(app(treemap, f), app(app(node, x), xs)) -> APP(app(node, app(f, x)), app(app(map, app(treemap, f)), xs)) APP(app(treemap, f), app(app(node, x), xs)) -> APP(node, app(f, x)) APP(app(treemap, f), app(app(node, x), xs)) -> APP(f, x) APP(app(treemap, f), app(app(node, x), xs)) -> APP(app(map, app(treemap, f)), xs) APP(app(treemap, f), app(app(node, x), xs)) -> APP(map, app(treemap, f)) The TRS R consists of the following rules: app(app(map, f), nil) -> nil app(app(map, f), app(app(cons, x), xs)) -> app(app(cons, app(f, x)), app(app(map, f), xs)) app(app(treemap, f), app(app(node, x), xs)) -> app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs)) The set Q consists of the following terms: app(app(map, x0), nil) app(app(map, x0), app(app(cons, x1), x2)) app(app(treemap, x0), app(app(node, x1), x2)) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 5 less nodes. ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard