details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.25912 seconds
cpu usage	5.3294
user time	5.08979
system time	0.23961
max virtual memory	1.8546884E7
max residence set size	384248.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, 57 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) ATransformationProof [EQUIVALENT, 0 ms] (11) QDP (12) QReductionProof [EQUIVALENT, 0 ms] (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) QDP (19) ATransformationProof [EQUIVALENT, 0 ms] (20) QDP (21) QReductionProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 8 ms] (24) QDP (25) PisEmptyProof [EQUIVALENT, 0 ms] (26) YES (27) QDP (28) UsableRulesProof [EQUIVALENT, 0 ms] (29) QDP (30) ATransformationProof [EQUIVALENT, 0 ms] (31) QDP (32) QReductionProof [EQUIVALENT, 0 ms] (33) QDP (34) QDPOrderProof [EQUIVALENT, 0 ms] (35) QDP (36) PisEmptyProof [EQUIVALENT, 0 ms] (37) YES (38) QDP (39) QDPSizeChangeProof [EQUIVALENT, 0 ms] (40) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(app(minus, x), 0) -> x app(app(minus, app(s, x)), app(s, y)) -> app(app(minus, x), y) app(app(quot, 0), app(s, y)) -> 0 app(app(quot, app(s, x)), app(s, y)) -> app(s, app(app(quot, app(app(minus, x), y)), app(s, y))) app(log, app(s, 0)) -> 0 app(log, app(s, app(s, x))) -> app(s, app(log, app(s, app(app(quot, x), app(s, app(s, 0)))))) 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) 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(minus, x), 0) -> x app(app(minus, app(s, x)), app(s, y)) -> app(app(minus, x), y) app(app(quot, 0), app(s, y)) -> 0 app(app(quot, app(s, x)), app(s, y)) -> app(s, app(app(quot, app(app(minus, x), y)), app(s, y))) app(log, app(s, 0)) -> 0 app(log, app(s, app(s, x))) -> app(s, app(log, app(s, app(app(quot, x), app(s, app(s, 0)))))) 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(minus, x0), 0) app(app(minus, app(s, x0)), app(s, x1)) popout

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

job log

popout

actions

all output return to TRS Standard