details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.59235191345 seconds
cpu usage	3.567739974
max memory	2.26353152E8

stage attributes

key	value
output-size	6279
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSToCSRProof [SOUND, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 53 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(and(tt, X)) -> mark(X) active(isNePal(__(I, __(P, I)))) -> mark(tt) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(and(X1, X2)) -> and(active(X1), X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) and(mark(X1), X2) -> mark(and(X1, X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1), ok(X2)) -> ok(__(X1, X2)) and(ok(X1), ok(X2)) -> ok(and(X1, X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The set Q consists of the following terms: active(__(x0, x1)) active(and(x0, x1)) active(isNePal(x0)) __(mark(x0), x1) __(x0, mark(x1)) and(mark(x0), x1) isNePal(mark(x0)) proper(__(x0, x1)) proper(nil) proper(and(x0, x1)) proper(tt) proper(isNePal(x0)) __(ok(x0), ok(x1)) and(ok(x0), ok(x1)) isNePal(ok(x0)) top(mark(x0)) top(ok(x0)) ---------------------------------------- (1) QTRSToCSRProof (SOUND) The following Q TRS is given: Q restricted rewrite system: The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(and(tt, X)) -> mark(X) active(isNePal(__(I, __(P, I)))) -> mark(tt) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(and(X1, X2)) -> and(active(X1), X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) and(mark(X1), X2) -> mark(and(X1, X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(isNePal(X)) -> isNePal(proper(X)) popout

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

job log

popout

actions

all output return to TRS Innermost