details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.48646593094 seconds
cpu usage	6.140291877
max memory	3.00744704E8

stage attributes

key	value
output-size	16317
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) QTRSRRRProof [EQUIVALENT, 521 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 2 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: __(__(X, Y), Z) -> __(X, __(Y, Z)) __(X, nil) -> X __(nil, X) -> X U11(tt, V) -> U12(isPalListKind(activate(V)), activate(V)) U12(tt, V) -> U13(isNeList(activate(V))) U13(tt) -> tt U21(tt, V1, V2) -> U22(isPalListKind(activate(V1)), activate(V1), activate(V2)) U22(tt, V1, V2) -> U23(isPalListKind(activate(V2)), activate(V1), activate(V2)) U23(tt, V1, V2) -> U24(isPalListKind(activate(V2)), activate(V1), activate(V2)) U24(tt, V1, V2) -> U25(isList(activate(V1)), activate(V2)) U25(tt, V2) -> U26(isList(activate(V2))) U26(tt) -> tt U31(tt, V) -> U32(isPalListKind(activate(V)), activate(V)) U32(tt, V) -> U33(isQid(activate(V))) U33(tt) -> tt U41(tt, V1, V2) -> U42(isPalListKind(activate(V1)), activate(V1), activate(V2)) U42(tt, V1, V2) -> U43(isPalListKind(activate(V2)), activate(V1), activate(V2)) U43(tt, V1, V2) -> U44(isPalListKind(activate(V2)), activate(V1), activate(V2)) U44(tt, V1, V2) -> U45(isList(activate(V1)), activate(V2)) U45(tt, V2) -> U46(isNeList(activate(V2))) U46(tt) -> tt U51(tt, V1, V2) -> U52(isPalListKind(activate(V1)), activate(V1), activate(V2)) U52(tt, V1, V2) -> U53(isPalListKind(activate(V2)), activate(V1), activate(V2)) U53(tt, V1, V2) -> U54(isPalListKind(activate(V2)), activate(V1), activate(V2)) U54(tt, V1, V2) -> U55(isNeList(activate(V1)), activate(V2)) U55(tt, V2) -> U56(isList(activate(V2))) U56(tt) -> tt U61(tt, V) -> U62(isPalListKind(activate(V)), activate(V)) U62(tt, V) -> U63(isQid(activate(V))) U63(tt) -> tt U71(tt, I, P) -> U72(isPalListKind(activate(I)), activate(P)) U72(tt, P) -> U73(isPal(activate(P)), activate(P)) U73(tt, P) -> U74(isPalListKind(activate(P))) U74(tt) -> tt U81(tt, V) -> U82(isPalListKind(activate(V)), activate(V)) U82(tt, V) -> U83(isNePal(activate(V))) U83(tt) -> tt U91(tt, V2) -> U92(isPalListKind(activate(V2))) U92(tt) -> tt isList(V) -> U11(isPalListKind(activate(V)), activate(V)) isList(n__nil) -> tt isList(n____(V1, V2)) -> U21(isPalListKind(activate(V1)), activate(V1), activate(V2)) isNeList(V) -> U31(isPalListKind(activate(V)), activate(V)) isNeList(n____(V1, V2)) -> U41(isPalListKind(activate(V1)), activate(V1), activate(V2)) isNeList(n____(V1, V2)) -> U51(isPalListKind(activate(V1)), activate(V1), activate(V2)) isNePal(V) -> U61(isPalListKind(activate(V)), activate(V)) isNePal(n____(I, n____(P, I))) -> U71(isQid(activate(I)), activate(I), activate(P)) isPal(V) -> U81(isPalListKind(activate(V)), activate(V)) isPal(n__nil) -> tt isPalListKind(n__a) -> tt isPalListKind(n__e) -> tt isPalListKind(n__i) -> tt isPalListKind(n__nil) -> tt isPalListKind(n__o) -> tt isPalListKind(n__u) -> tt isPalListKind(n____(V1, V2)) -> U91(isPalListKind(activate(V1)), activate(V2)) isQid(n__a) -> tt isQid(n__e) -> tt isQid(n__i) -> tt isQid(n__o) -> tt isQid(n__u) -> tt nil -> n__nil __(X1, X2) -> n____(X1, X2) a -> n__a e -> n__e i -> n__i o -> n__o u -> n__u activate(n__nil) -> nil activate(n____(X1, X2)) -> __(activate(X1), activate(X2)) activate(n__a) -> a popout

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

job log

popout

actions

all output return to TRS Stand 20472