details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.65231490135 seconds
cpu usage	22.307812476
max memory	2.783465472E9

stage attributes

key	value
output-size	25838
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 72 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 17 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, 15 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 42 ms] (14) QDP (15) TransformationProof [EQUIVALENT, 0 ms] (16) QDP (17) TransformationProof [EQUIVALENT, 0 ms] (18) QDP (19) TransformationProof [EQUIVALENT, 0 ms] (20) QDP (21) DependencyGraphProof [EQUIVALENT, 0 ms] (22) QDP (23) TransformationProof [EQUIVALENT, 0 ms] (24) QDP (25) DependencyGraphProof [EQUIVALENT, 0 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 30 ms] (28) QDP (29) QDPOrderProof [EQUIVALENT, 398 ms] (30) QDP (31) NonTerminationLoopProof [COMPLETE, 33 ms] (32) 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(activate(X)) activate(n__adx(X)) -> adx(activate(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) popout

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

job log

popout

actions

all output return to TRS Stand 20472