details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	12.1749 seconds
cpu usage	44.8137
user time	43.0392
system time	1.77453
max virtual memory	3.9703212E7
max residence set size	4317500.0

stage attributes

key	value
starexec-result	YES

output

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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 75 ms] (4) QTRS (5) Overlay + Local Confluence [EQUIVALENT, 2 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 48 ms] (8) QDP (9) MRRProof [EQUIVALENT, 701 ms] (10) QDP (11) PisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(b(b(x1)))) -> C(C(x1)) b(b(c(c(x1)))) -> A(A(x1)) c(c(a(a(x1)))) -> B(B(x1)) A(A(C(C(x1)))) -> b(b(x1)) C(C(B(B(x1)))) -> a(a(x1)) B(B(A(A(x1)))) -> c(c(x1)) a(a(a(a(a(a(a(a(a(a(x1)))))))))) -> A(A(A(A(A(A(x1)))))) A(A(A(A(A(A(A(A(x1)))))))) -> a(a(a(a(a(a(a(a(x1)))))))) b(b(b(b(b(b(b(b(b(b(x1)))))))))) -> B(B(B(B(B(B(x1)))))) B(B(B(B(B(B(B(B(x1)))))))) -> b(b(b(b(b(b(b(b(x1)))))))) c(c(c(c(c(c(c(c(c(c(x1)))))))))) -> C(C(C(C(C(C(x1)))))) C(C(C(C(C(C(C(C(x1)))))))) -> c(c(c(c(c(c(c(c(x1)))))))) B(B(a(a(a(a(a(a(a(a(x1)))))))))) -> c(c(A(A(A(A(A(A(x1)))))))) A(A(A(A(A(A(b(b(x1)))))))) -> a(a(a(a(a(a(a(a(C(C(x1)))))))))) C(C(b(b(b(b(b(b(b(b(x1)))))))))) -> a(a(B(B(B(B(B(B(x1)))))))) B(B(B(B(B(B(c(c(x1)))))))) -> b(b(b(b(b(b(b(b(A(A(x1)))))))))) A(A(c(c(c(c(c(c(c(c(x1)))))))))) -> b(b(C(C(C(C(C(C(x1)))))))) C(C(C(C(C(C(a(a(x1)))))))) -> c(c(c(c(c(c(c(c(B(B(x1)))))))))) a(a(A(A(x1)))) -> x1 A(A(a(a(x1)))) -> x1 b(b(B(B(x1)))) -> x1 B(B(b(b(x1)))) -> x1 c(c(C(C(x1)))) -> x1 C(C(c(c(x1)))) -> x1 Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(a(a(x1)))) -> C(C(x1)) c(c(b(b(x1)))) -> A(A(x1)) a(a(c(c(x1)))) -> B(B(x1)) C(C(A(A(x1)))) -> b(b(x1)) B(B(C(C(x1)))) -> a(a(x1)) A(A(B(B(x1)))) -> c(c(x1)) a(a(a(a(a(a(a(a(a(a(x1)))))))))) -> A(A(A(A(A(A(x1)))))) A(A(A(A(A(A(A(A(x1)))))))) -> a(a(a(a(a(a(a(a(x1)))))))) b(b(b(b(b(b(b(b(b(b(x1)))))))))) -> B(B(B(B(B(B(x1)))))) B(B(B(B(B(B(B(B(x1)))))))) -> b(b(b(b(b(b(b(b(x1)))))))) c(c(c(c(c(c(c(c(c(c(x1)))))))))) -> C(C(C(C(C(C(x1)))))) C(C(C(C(C(C(C(C(x1)))))))) -> c(c(c(c(c(c(c(c(x1)))))))) a(a(a(a(a(a(a(a(B(B(x1)))))))))) -> A(A(A(A(A(A(c(c(x1)))))))) b(b(A(A(A(A(A(A(x1)))))))) -> C(C(a(a(a(a(a(a(a(a(x1)))))))))) b(b(b(b(b(b(b(b(C(C(x1)))))))))) -> B(B(B(B(B(B(a(a(x1)))))))) c(c(B(B(B(B(B(B(x1)))))))) -> A(A(b(b(b(b(b(b(b(b(x1)))))))))) c(c(c(c(c(c(c(c(A(A(x1)))))))))) -> C(C(C(C(C(C(b(b(x1)))))))) a(a(C(C(C(C(C(C(x1)))))))) -> B(B(c(c(c(c(c(c(c(c(x1)))))))))) A(A(a(a(x1)))) -> x1 a(a(A(A(x1)))) -> x1 B(B(b(b(x1)))) -> x1 b(b(B(B(x1)))) -> x1 C(C(c(c(x1)))) -> x1 c(c(C(C(x1)))) -> x1 Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: popout

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

job log

popout

actions

all output return to SRS Standard