details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.57602 seconds
cpu usage	10.367
user time	9.91186
system time	0.455188
max virtual memory	1.949252E7
max residence set size	1103644.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) FlatCCProof [SOUND, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 37 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 0 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 12 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 121 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(d(x)) -> d(c(b(a(x)))) b(c(x)) -> c(d(a(b(x)))) a(c(x)) -> x b(d(x)) -> x The set Q consists of the following terms: a(d(x0)) b(c(x0)) a(c(x0)) b(d(x0)) ---------------------------------------- (1) FlatCCProof (SOUND) We used flat context closure [ROOTLAB] ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(d(x))) -> a(d(c(b(a(x))))) d(a(d(x))) -> d(d(c(b(a(x))))) c(a(d(x))) -> c(d(c(b(a(x))))) b(a(d(x))) -> b(d(c(b(a(x))))) a(b(c(x))) -> a(c(d(a(b(x))))) d(b(c(x))) -> d(c(d(a(b(x))))) c(b(c(x))) -> c(c(d(a(b(x))))) b(b(c(x))) -> b(c(d(a(b(x))))) a(a(c(x))) -> a(x) d(a(c(x))) -> d(x) c(a(c(x))) -> c(x) b(a(c(x))) -> b(x) a(b(d(x))) -> a(x) d(b(d(x))) -> d(x) c(b(d(x))) -> c(x) b(b(d(x))) -> b(x) 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_{d_1}(d_{a_1}(x))) -> a_{d_1}(d_{c_1}(c_{b_1}(b_{a_1}(a_{a_1}(x))))) a_{a_1}(a_{d_1}(d_{d_1}(x))) -> a_{d_1}(d_{c_1}(c_{b_1}(b_{a_1}(a_{d_1}(x))))) a_{a_1}(a_{d_1}(d_{c_1}(x))) -> a_{d_1}(d_{c_1}(c_{b_1}(b_{a_1}(a_{c_1}(x))))) a_{a_1}(a_{d_1}(d_{b_1}(x))) -> a_{d_1}(d_{c_1}(c_{b_1}(b_{a_1}(a_{b_1}(x))))) d_{a_1}(a_{d_1}(d_{a_1}(x))) -> d_{d_1}(d_{c_1}(c_{b_1}(b_{a_1}(a_{a_1}(x))))) d_{a_1}(a_{d_1}(d_{d_1}(x))) -> d_{d_1}(d_{c_1}(c_{b_1}(b_{a_1}(a_{d_1}(x))))) d_{a_1}(a_{d_1}(d_{c_1}(x))) -> d_{d_1}(d_{c_1}(c_{b_1}(b_{a_1}(a_{c_1}(x))))) d_{a_1}(a_{d_1}(d_{b_1}(x))) -> d_{d_1}(d_{c_1}(c_{b_1}(b_{a_1}(a_{b_1}(x))))) c_{a_1}(a_{d_1}(d_{a_1}(x))) -> c_{d_1}(d_{c_1}(c_{b_1}(b_{a_1}(a_{a_1}(x))))) c_{a_1}(a_{d_1}(d_{d_1}(x))) -> c_{d_1}(d_{c_1}(c_{b_1}(b_{a_1}(a_{d_1}(x))))) popout

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

job log

popout

actions

all output return to TRS Innermost