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	n045.star.cs.uiowa.edu
space	AotoYamada_05

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	3.4262778759 seconds
cpu usage	6.025301369
max memory	4.78457856E8

stage attributes

key	value
output-size	6369
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) Overlay + Local Confluence [EQUIVALENT, 4 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(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)) popout

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

job log

popout

actions

all output return to TRS Standard