details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.7356159687 seconds
cpu usage	21.626267492
max memory	2.260160512E9

stage attributes

key	value
output-size	82495
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES 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 proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 46 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 353 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) QDPOrderProof [EQUIVALENT, 263 ms] (11) QDP (12) QDPOrderProof [EQUIVALENT, 265 ms] (13) QDP (14) DependencyGraphProof [EQUIVALENT, 0 ms] (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) QDPOrderProof [EQUIVALENT, 117 ms] (24) QDP (25) DependencyGraphProof [EQUIVALENT, 0 ms] (26) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__zeros -> cons(0, zeros) a__U11(tt, V1) -> a__U12(a__isNatList(V1)) a__U12(tt) -> tt a__U21(tt, V1) -> a__U22(a__isNat(V1)) a__U22(tt) -> tt a__U31(tt, V) -> a__U32(a__isNatList(V)) a__U32(tt) -> tt a__U41(tt, V1, V2) -> a__U42(a__isNat(V1), V2) a__U42(tt, V2) -> a__U43(a__isNatIList(V2)) a__U43(tt) -> tt a__U51(tt, V1, V2) -> a__U52(a__isNat(V1), V2) a__U52(tt, V2) -> a__U53(a__isNatList(V2)) a__U53(tt) -> tt a__U61(tt, L) -> s(a__length(mark(L))) a__and(tt, X) -> mark(X) a__isNat(0) -> tt a__isNat(length(V1)) -> a__U11(a__isNatIListKind(V1), V1) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1), V1) a__isNatIList(V) -> a__U31(a__isNatIListKind(V), V) a__isNatIList(zeros) -> tt a__isNatIList(cons(V1, V2)) -> a__U41(a__and(a__isNatKind(V1), isNatIListKind(V2)), V1, V2) a__isNatIListKind(nil) -> tt a__isNatIListKind(zeros) -> tt a__isNatIListKind(cons(V1, V2)) -> a__and(a__isNatKind(V1), isNatIListKind(V2)) a__isNatKind(0) -> tt a__isNatKind(length(V1)) -> a__isNatIListKind(V1) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__isNatList(nil) -> tt a__isNatList(cons(V1, V2)) -> a__U51(a__and(a__isNatKind(V1), isNatIListKind(V2)), V1, V2) a__length(nil) -> 0 a__length(cons(N, L)) -> a__U61(a__and(a__and(a__isNatList(L), isNatIListKind(L)), and(isNat(N), isNatKind(N))), L) mark(zeros) -> a__zeros mark(U11(X1, X2)) -> a__U11(mark(X1), X2) mark(U12(X)) -> a__U12(mark(X)) mark(isNatList(X)) -> a__isNatList(X) mark(U21(X1, X2)) -> a__U21(mark(X1), X2) mark(U22(X)) -> a__U22(mark(X)) mark(isNat(X)) -> a__isNat(X) mark(U31(X1, X2)) -> a__U31(mark(X1), X2) mark(U32(X)) -> a__U32(mark(X)) mark(U41(X1, X2, X3)) -> a__U41(mark(X1), X2, X3) mark(U42(X1, X2)) -> a__U42(mark(X1), X2) mark(U43(X)) -> a__U43(mark(X)) mark(isNatIList(X)) -> a__isNatIList(X) mark(U51(X1, X2, X3)) -> a__U51(mark(X1), X2, X3) mark(U52(X1, X2)) -> a__U52(mark(X1), X2) mark(U53(X)) -> a__U53(mark(X)) mark(U61(X1, X2)) -> a__U61(mark(X1), X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1, X2)) -> a__and(mark(X1), X2) mark(isNatIListKind(X)) -> a__isNatIListKind(X) popout

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

job log

popout

actions

all output return to TRS Inner 89993