details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	3.00312900543 seconds
cpu usage	8.105521713
max memory	5.55896832E8

stage attributes

key	value
output-size	17497
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 83 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 17 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 14 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 10 ms] (8) QTRS (9) Overlay + Local Confluence [EQUIVALENT, 0 ms] (10) QTRS (11) DependencyPairsProof [EQUIVALENT, 13 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) AND (15) QDP (16) UsableRulesProof [EQUIVALENT, 0 ms] (17) QDP (18) QReductionProof [EQUIVALENT, 0 ms] (19) QDP (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] (21) YES (22) QDP (23) UsableRulesProof [EQUIVALENT, 0 ms] (24) QDP (25) QReductionProof [EQUIVALENT, 0 ms] (26) QDP (27) MRRProof [EQUIVALENT, 0 ms] (28) QDP (29) TransformationProof [EQUIVALENT, 0 ms] (30) QDP (31) UsableRulesProof [EQUIVALENT, 0 ms] (32) QDP (33) QReductionProof [EQUIVALENT, 0 ms] (34) QDP (35) TransformationProof [EQUIVALENT, 0 ms] (36) QDP (37) UsableRulesProof [EQUIVALENT, 0 ms] (38) QDP (39) QReductionProof [EQUIVALENT, 0 ms] (40) QDP (41) TransformationProof [EQUIVALENT, 0 ms] (42) QDP (43) NonTerminationLoopProof [COMPLETE, 7 ms] (44) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__zeros -> cons(0, zeros) a__and(tt, X) -> mark(X) a__length(nil) -> 0 a__length(cons(N, L)) -> s(a__length(mark(L))) mark(zeros) -> a__zeros mark(and(X1, X2)) -> a__and(mark(X1), X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(0) -> 0 mark(tt) -> tt mark(nil) -> nil mark(s(X)) -> s(mark(X)) a__zeros -> zeros a__and(X1, X2) -> and(X1, X2) a__length(X) -> length(X) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(a__and(x_1, x_2)) = 2*x_1 + 2*x_2 POL(a__length(x_1)) = 2 + x_1 POL(a__zeros) = 0 POL(and(x_1, x_2)) = 2*x_1 + 2*x_2 POL(cons(x_1, x_2)) = 2*x_1 + 2*x_2 POL(length(x_1)) = 1 + x_1 POL(mark(x_1)) = 2*x_1 POL(nil) = 2 popout

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

job log

popout

actions

all output return to TRS Standard