details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.26405286789 seconds
cpu usage	5.837056716
max memory	4.90942464E8

stage attributes

key	value
output-size	5083
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) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 9 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 1 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 2 ms] (10) QTRS (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(x1))) -> b(x1) b(b(x1)) -> b(a(b(x1))) b(b(x1)) -> a(a(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: b(b(x1)) -> b(a(b(x1))) a(a(a(a(x1)))) -> a(b(x1)) b(a(a(a(x1)))) -> b(b(x1)) a(b(b(x1))) -> a(a(a(x1))) b(b(b(x1))) -> b(a(a(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: b_{b_1}(b_{b_1}(x1)) -> b_{a_1}(a_{b_1}(b_{b_1}(x1))) b_{b_1}(b_{a_1}(x1)) -> b_{a_1}(a_{b_1}(b_{a_1}(x1))) a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) -> a_{b_1}(b_{b_1}(x1)) a_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) -> a_{b_1}(b_{a_1}(x1)) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) -> b_{b_1}(b_{b_1}(x1)) b_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) -> b_{b_1}(b_{a_1}(x1)) a_{b_1}(b_{b_1}(b_{b_1}(x1))) -> a_{a_1}(a_{a_1}(a_{b_1}(x1))) a_{b_1}(b_{b_1}(b_{a_1}(x1))) -> a_{a_1}(a_{a_1}(a_{a_1}(x1))) b_{b_1}(b_{b_1}(b_{b_1}(x1))) -> b_{a_1}(a_{a_1}(a_{b_1}(x1))) b_{b_1}(b_{b_1}(b_{a_1}(x1))) -> b_{a_1}(a_{a_1}(a_{a_1}(x1))) Q is empty. ---------------------------------------- (5) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a_{a_1}(x_1)) = 1 + x_1 POL(a_{b_1}(x_1)) = 2 + x_1 POL(b_{a_1}(x_1)) = x_1 POL(b_{b_1}(x_1)) = 2 + x_1 popout

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

job log

popout

actions

all output return to SRS Stand 10685