details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.80589 seconds
cpu usage	4.10685
user time	3.92756
system time	0.179285
max virtual memory	1.8407092E7
max residence set size	259928.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 46 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 13 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 14 ms] (10) CSR (11) CSRRRRProof [EQUIVALENT, 0 ms] (12) CSR (13) CSRRRRProof [EQUIVALENT, 0 ms] (14) CSR (15) CSRRRRProof [EQUIVALENT, 2 ms] (16) CSR (17) RisEmptyProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: __(__(X, Y), Z) -> __(X, __(Y, Z)) __(X, nil) -> X __(nil, X) -> X and(tt, X) -> X isList(V) -> isNeList(V) isList(nil) -> tt isList(__(V1, V2)) -> and(isList(V1), isList(V2)) isNeList(V) -> isQid(V) isNeList(__(V1, V2)) -> and(isList(V1), isNeList(V2)) isNeList(__(V1, V2)) -> and(isNeList(V1), isList(V2)) isNePal(V) -> isQid(V) isNePal(__(I, __(P, I))) -> and(isQid(I), isPal(P)) isPal(V) -> isNePal(V) isPal(nil) -> tt isQid(a) -> tt isQid(e) -> tt isQid(i) -> tt isQid(o) -> tt isQid(u) -> tt The replacement map contains the following entries: __: {1, 2} nil: empty set and: {1} tt: empty set isList: empty set isNeList: empty set isQid: empty set isNePal: empty set isPal: empty set a: empty set e: empty set i: empty set o: empty set u: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: __(__(X, Y), Z) -> __(X, __(Y, Z)) __(X, nil) -> X __(nil, X) -> X and(tt, X) -> X isList(V) -> isNeList(V) isList(nil) -> tt isList(__(V1, V2)) -> and(isList(V1), isList(V2)) isNeList(V) -> isQid(V) isNeList(__(V1, V2)) -> and(isList(V1), isNeList(V2)) isNeList(__(V1, V2)) -> and(isNeList(V1), isList(V2)) isNePal(V) -> isQid(V) isNePal(__(I, __(P, I))) -> and(isQid(I), isPal(P)) isPal(V) -> isNePal(V) isPal(nil) -> tt isQid(a) -> tt isQid(e) -> tt isQid(i) -> tt isQid(o) -> tt isQid(u) -> tt The replacement map contains the following entries: popout

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

job log

popout

actions

all output return to TRS Contextsensitive