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	n025.star.cs.uiowa.edu
space	AProVE_04

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.78432798386 seconds
cpu usage	4.235867729
max memory	2.59473408E8

stage attributes

key	value
output-size	8841
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 73 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 15 ms] (4) QTRS (5) Overlay + Local Confluence [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 17 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 popout

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

job log

popout

actions

all output return to TRS Stand 20472