details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.8941 seconds
cpu usage	4.56793
user time	4.39387
system time	0.174056
max virtual memory	1.8411936E7
max residence set size	274376.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) DependencyPairsProof [EQUIVALENT, 21 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) ATransformationProof [EQUIVALENT, 0 ms] (9) QDP (10) QReductionProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(app(app(quot, 0), app(s, y)), app(s, z)) -> 0 app(app(app(quot, app(s, x)), app(s, y)), z) -> app(app(app(quot, x), y), z) app(app(app(quot, x), 0), app(s, z)) -> app(s, app(app(app(quot, x), app(s, z)), app(s, z))) 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(filter, f), nil) -> nil app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(app(filter2, app(f, x)), f), x), xs) app(app(app(app(filter2, true), f), x), xs) -> app(app(cons, x), app(app(filter, f), xs)) app(app(app(app(filter2, false), f), x), xs) -> app(app(filter, f), xs) The set Q consists of the following terms: app(app(app(quot, 0), app(s, x0)), app(s, x1)) app(app(app(quot, app(s, x0)), app(s, x1)), x2) app(app(app(quot, x0), 0), app(s, x1)) app(app(map, x0), nil) app(app(map, x0), app(app(cons, x1), x2)) app(app(filter, x0), nil) app(app(filter, x0), app(app(cons, x1), x2)) app(app(app(app(filter2, true), x0), x1), x2) app(app(app(app(filter2, false), x0), x1), x2) ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: APP(app(app(quot, app(s, x)), app(s, y)), z) -> APP(app(app(quot, x), y), z) APP(app(app(quot, app(s, x)), app(s, y)), z) -> APP(app(quot, x), y) APP(app(app(quot, app(s, x)), app(s, y)), z) -> APP(quot, x) APP(app(app(quot, x), 0), app(s, z)) -> APP(s, app(app(app(quot, x), app(s, z)), app(s, z))) APP(app(app(quot, x), 0), app(s, z)) -> APP(app(app(quot, x), app(s, z)), app(s, z)) APP(app(app(quot, x), 0), app(s, z)) -> APP(app(quot, x), app(s, z)) 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(filter, f), app(app(cons, x), xs)) -> APP(app(app(app(filter2, app(f, x)), f), x), xs) APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(app(filter2, app(f, x)), f), x) APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(filter2, app(f, x)), f) APP(app(filter, f), app(app(cons, x), xs)) -> APP(filter2, app(f, x)) APP(app(filter, f), app(app(cons, x), xs)) -> APP(f, x) APP(app(app(app(filter2, true), f), x), xs) -> APP(app(cons, x), app(app(filter, f), xs)) APP(app(app(app(filter2, true), f), x), xs) -> APP(cons, x) APP(app(app(app(filter2, true), f), x), xs) -> APP(app(filter, f), xs) APP(app(app(app(filter2, true), f), x), xs) -> APP(filter, f) APP(app(app(app(filter2, false), f), x), xs) -> APP(app(filter, f), xs) APP(app(app(app(filter2, false), f), x), xs) -> APP(filter, f) The TRS R consists of the following rules: app(app(app(quot, 0), app(s, y)), app(s, z)) -> 0 app(app(app(quot, app(s, x)), app(s, y)), z) -> app(app(app(quot, x), y), z) app(app(app(quot, x), 0), app(s, z)) -> app(s, app(app(app(quot, x), app(s, z)), app(s, z))) 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(filter, f), nil) -> nil app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(app(filter2, app(f, x)), f), x), xs) popout

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

job log

popout

actions

all output return to TRS Innermost