details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.97292 seconds
cpu usage	3.98465
user time	3.81388
system time	0.170776
max virtual memory	1.8408912E7
max residence set size	246552.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/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, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 39 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(mapt, f), app(leaf, x)) -> app(leaf, app(f, x)) app(app(mapt, f), app(node, xs)) -> app(node, app(app(maptlist, f), xs)) app(app(maptlist, f), nil) -> nil app(app(maptlist, f), app(app(cons, x), xs)) -> app(app(cons, app(app(mapt, f), x)), app(app(maptlist, 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(mapt, f), app(leaf, x)) -> app(leaf, app(f, x)) app(app(mapt, f), app(node, xs)) -> app(node, app(app(maptlist, f), xs)) app(app(maptlist, f), nil) -> nil app(app(maptlist, f), app(app(cons, x), xs)) -> app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs)) The set Q consists of the following terms: app(app(mapt, x0), app(leaf, x1)) app(app(mapt, x0), app(node, x1)) app(app(maptlist, x0), nil) app(app(maptlist, x0), app(app(cons, 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(mapt, f), app(leaf, x)) -> APP(leaf, app(f, x)) APP(app(mapt, f), app(leaf, x)) -> APP(f, x) APP(app(mapt, f), app(node, xs)) -> APP(node, app(app(maptlist, f), xs)) APP(app(mapt, f), app(node, xs)) -> APP(app(maptlist, f), xs) APP(app(mapt, f), app(node, xs)) -> APP(maptlist, f) APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs)) APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(cons, app(app(mapt, f), x)) APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(app(mapt, f), x) APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(mapt, f) APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(app(maptlist, f), xs) The TRS R consists of the following rules: app(app(mapt, f), app(leaf, x)) -> app(leaf, app(f, x)) app(app(mapt, f), app(node, xs)) -> app(node, app(app(maptlist, f), xs)) app(app(maptlist, f), nil) -> nil app(app(maptlist, f), app(app(cons, x), xs)) -> app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs)) The set Q consists of the following terms: app(app(mapt, x0), app(leaf, x1)) app(app(mapt, x0), app(node, x1)) app(app(maptlist, x0), nil) app(app(maptlist, x0), app(app(cons, 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 6 less nodes. ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Standard