details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.87661 seconds
cpu usage	4.12533
user time	3.93816
system time	0.187168
max virtual memory	1.8408912E7
max residence set size	263536.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) QTRSRRRProof [EQUIVALENT, 74 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) Overlay + Local Confluence [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) AND (11) QDP (12) UsableRulesProof [EQUIVALENT, 0 ms] (13) QDP (14) QReductionProof [EQUIVALENT, 0 ms] (15) QDP (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] (17) YES (18) QDP (19) UsableRulesProof [EQUIVALENT, 0 ms] (20) QDP (21) QReductionProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] (24) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: intlist(nil) -> nil int(s(x), 0) -> nil int(x, x) -> cons(x, nil) intlist(cons(x, y)) -> cons(s(x), intlist(y)) int(s(x), s(y)) -> intlist(int(x, y)) int(0, s(y)) -> cons(0, int(s(0), s(y))) intlist(cons(x, nil)) -> cons(s(x), nil) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(cons(x_1, x_2)) = 2*x_1 + x_2 POL(int(x_1, x_2)) = 1 + 2*x_1 + x_2 POL(intlist(x_1)) = x_1 POL(nil) = 0 POL(s(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: int(s(x), 0) -> nil int(x, x) -> cons(x, nil) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: intlist(nil) -> nil intlist(cons(x, y)) -> cons(s(x), intlist(y)) int(s(x), s(y)) -> intlist(int(x, y)) int(0, s(y)) -> cons(0, int(s(0), s(y))) intlist(cons(x, nil)) -> cons(s(x), nil) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(cons(x_1, x_2)) = 2*x_1 + x_2 POL(int(x_1, x_2)) = 2*x_1 + x_2 POL(intlist(x_1)) = 2*x_1 POL(nil) = 2 POL(s(x_1)) = 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: popout

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

job log

popout

actions

all output return to TRS Standard