details

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

run statistics

property	value
solver	AProVE23
configuration	standard
runtime (wallclock)	10.5170309544 seconds
cpu usage	29.811290314
max memory	1.230618624E9

stage attributes

key	value
output-size	13683
starexec-result	"NO"

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 363435ff5b19173ec8a83b45cfdec073678dabcc jan-christoph 20230815 unpublished Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 91 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) MRRProof [EQUIVALENT, 11 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 75 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 29 ms] (12) QDP (13) TransformationProof [EQUIVALENT, 0 ms] (14) QDP (15) NonTerminationLoopProof [COMPLETE, 11 ms] (16) 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(X) activate(n__adx(X)) -> adx(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)) = 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 POL(nats) = 2 POL(s(x_1)) = x_1 POL(tl(x_1)) = 1 + 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) hd(cons(X, Y)) -> activate(X) tl(cons(X, Y)) -> activate(Y) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 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)))) 0 -> n__0 popout

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

job log

popout

actions

all output return to TRS Standard