details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.48 seconds
cpu usage	26.1453
user time	25.1143
system time	1.03096
max virtual memory	1.8563436E7
max residence set size	2577524.0

stage attributes

key	value
starexec-result	NO

output

NO 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 disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 67 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) MRRProof [EQUIVALENT, 1 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 111 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 50 ms] (12) QDP (13) TransformationProof [EQUIVALENT, 0 ms] (14) QDP (15) TransformationProof [EQUIVALENT, 0 ms] (16) QDP (17) TransformationProof [EQUIVALENT, 0 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) QDP (21) TransformationProof [EQUIVALENT, 0 ms] (22) QDP (23) DependencyGraphProof [EQUIVALENT, 0 ms] (24) QDP (25) TransformationProof [EQUIVALENT, 0 ms] (26) QDP (27) DependencyGraphProof [EQUIVALENT, 0 ms] (28) QDP (29) TransformationProof [EQUIVALENT, 0 ms] (30) QDP (31) DependencyGraphProof [EQUIVALENT, 0 ms] (32) QDP (33) TransformationProof [EQUIVALENT, 0 ms] (34) QDP (35) DependencyGraphProof [EQUIVALENT, 0 ms] (36) QDP (37) TransformationProof [EQUIVALENT, 0 ms] (38) QDP (39) DependencyGraphProof [EQUIVALENT, 0 ms] (40) QDP (41) QDPOrderProof [EQUIVALENT, 50 ms] (42) QDP (43) QDPOrderProof [EQUIVALENT, 362 ms] (44) QDP (45) NonTerminationLoopProof [COMPLETE, 0 ms] (46) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: nats -> adx(zeros) zeros -> cons(n__0, n__zeros) incr(cons(X, Y)) -> cons(n__s(activate(X)), n__incr(activate(Y))) adx(cons(X, Y)) -> incr(cons(activate(X), n__adx(activate(Y)))) hd(cons(X, Y)) -> activate(X) tl(cons(X, Y)) -> activate(Y) 0 -> n__0 zeros -> n__zeros s(X) -> n__s(X) incr(X) -> n__incr(X) adx(X) -> n__adx(X) activate(n__0) -> 0 activate(n__zeros) -> zeros activate(n__s(X)) -> s(X) activate(n__incr(X)) -> incr(activate(X)) activate(n__adx(X)) -> adx(activate(X)) 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 + 2*x_2 POL(hd(x_1)) = 1 + 2*x_1 POL(incr(x_1)) = x_1 POL(n__0) = 0 POL(n__adx(x_1)) = x_1 POL(n__incr(x_1)) = x_1 POL(n__s(x_1)) = x_1 POL(n__zeros) = 0 popout

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

job log

popout

actions

all output return to TRS Standard