details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.7798 seconds
cpu usage	16.5734
user time	16.1809
system time	0.39249
max virtual memory	1.8549356E7
max residence set size	614628.0

stage attributes

key	value
starexec-result	NO

output

NO 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 disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 58 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 19 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) MRRProof [EQUIVALENT, 13 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 52 ms] (14) QDP (15) TransformationProof [EQUIVALENT, 0 ms] (16) QDP (17) NonTerminationLoopProof [COMPLETE, 46 ms] (18) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: incr(nil) -> nil incr(cons(X, L)) -> cons(s(X), n__incr(activate(L))) adx(nil) -> nil adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L)))) nats -> adx(zeros) zeros -> cons(0, n__zeros) head(cons(X, L)) -> X tail(cons(X, L)) -> activate(L) incr(X) -> n__incr(X) adx(X) -> n__adx(X) zeros -> n__zeros activate(n__incr(X)) -> incr(X) activate(n__adx(X)) -> adx(X) activate(n__zeros) -> zeros activate(X) -> X Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(activate(x_1)) = x_1 POL(adx(x_1)) = x_1 POL(cons(x_1, x_2)) = x_1 + x_2 POL(head(x_1)) = 2*x_1 POL(incr(x_1)) = x_1 POL(n__adx(x_1)) = x_1 POL(n__incr(x_1)) = x_1 POL(n__zeros) = 0 POL(nats) = 2 POL(nil) = 0 POL(s(x_1)) = x_1 POL(tail(x_1)) = 2 + 2*x_1 POL(zeros) = 0 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: nats -> adx(zeros) tail(cons(X, L)) -> activate(L) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: incr(nil) -> nil incr(cons(X, L)) -> cons(s(X), n__incr(activate(L))) adx(nil) -> nil adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L)))) zeros -> cons(0, n__zeros) head(cons(X, L)) -> X incr(X) -> n__incr(X) adx(X) -> n__adx(X) zeros -> n__zeros activate(n__incr(X)) -> incr(X) activate(n__adx(X)) -> adx(X) activate(n__zeros) -> zeros popout

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

job log

popout

actions

all output return to TRS Standard