details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.62372 seconds
cpu usage	15.0032
user time	14.2383
system time	0.764922
max virtual memory	1.17492292E8
max residence set size	2165804.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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 1 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 123 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 42 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 20 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 138 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: A(b(x1)) -> b(a(B(A(x1)))) B(a(x1)) -> a(b(A(B(x1)))) A(a(x1)) -> x1 B(b(x1)) -> x1 Q is empty. ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: A(A(b(x1))) -> A(b(a(B(A(x1))))) b(A(b(x1))) -> b(b(a(B(A(x1))))) a(A(b(x1))) -> a(b(a(B(A(x1))))) B(A(b(x1))) -> B(b(a(B(A(x1))))) A(B(a(x1))) -> A(a(b(A(B(x1))))) b(B(a(x1))) -> b(a(b(A(B(x1))))) a(B(a(x1))) -> a(a(b(A(B(x1))))) B(B(a(x1))) -> B(a(b(A(B(x1))))) A(A(a(x1))) -> A(x1) b(A(a(x1))) -> b(x1) a(A(a(x1))) -> a(x1) B(A(a(x1))) -> B(x1) A(B(b(x1))) -> A(x1) b(B(b(x1))) -> b(x1) a(B(b(x1))) -> a(x1) B(B(b(x1))) -> B(x1) Q is empty. ---------------------------------------- (3) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: A_{A_1}(A_{b_1}(b_{A_1}(x1))) -> A_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{A_1}(x1))))) A_{A_1}(A_{b_1}(b_{b_1}(x1))) -> A_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{b_1}(x1))))) A_{A_1}(A_{b_1}(b_{a_1}(x1))) -> A_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{a_1}(x1))))) A_{A_1}(A_{b_1}(b_{B_1}(x1))) -> A_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{B_1}(x1))))) b_{A_1}(A_{b_1}(b_{A_1}(x1))) -> b_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{A_1}(x1))))) b_{A_1}(A_{b_1}(b_{b_1}(x1))) -> b_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{b_1}(x1))))) b_{A_1}(A_{b_1}(b_{a_1}(x1))) -> b_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{a_1}(x1))))) b_{A_1}(A_{b_1}(b_{B_1}(x1))) -> b_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{B_1}(x1))))) a_{A_1}(A_{b_1}(b_{A_1}(x1))) -> a_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{A_1}(x1))))) a_{A_1}(A_{b_1}(b_{b_1}(x1))) -> a_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{b_1}(x1))))) a_{A_1}(A_{b_1}(b_{a_1}(x1))) -> a_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{a_1}(x1))))) a_{A_1}(A_{b_1}(b_{B_1}(x1))) -> a_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{B_1}(x1))))) B_{A_1}(A_{b_1}(b_{A_1}(x1))) -> B_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{A_1}(x1))))) B_{A_1}(A_{b_1}(b_{b_1}(x1))) -> B_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{b_1}(x1))))) B_{A_1}(A_{b_1}(b_{a_1}(x1))) -> B_{b_1}(b_{a_1}(a_{B_1}(B_{A_1}(A_{a_1}(x1))))) popout

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

job log

popout

actions

all output return to SRS Standard