details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.5312769413 seconds
cpu usage	7.216572972
max memory	9.5444992E8

stage attributes

key	value
output-size	22542
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: 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, 96 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 1 ms] (8) QTRS (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(x1) -> g(d(x1)) b(b(b(x1))) -> c(d(c(x1))) b(b(x1)) -> a(g(g(x1))) c(d(x1)) -> g(g(x1)) g(g(g(x1))) -> b(b(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(x1)) -> a(g(d(x1))) g(a(x1)) -> g(g(d(x1))) d(a(x1)) -> d(g(d(x1))) b(a(x1)) -> b(g(d(x1))) c(a(x1)) -> c(g(d(x1))) a(b(b(b(x1)))) -> a(c(d(c(x1)))) g(b(b(b(x1)))) -> g(c(d(c(x1)))) d(b(b(b(x1)))) -> d(c(d(c(x1)))) b(b(b(b(x1)))) -> b(c(d(c(x1)))) c(b(b(b(x1)))) -> c(c(d(c(x1)))) a(b(b(x1))) -> a(a(g(g(x1)))) g(b(b(x1))) -> g(a(g(g(x1)))) d(b(b(x1))) -> d(a(g(g(x1)))) b(b(b(x1))) -> b(a(g(g(x1)))) c(b(b(x1))) -> c(a(g(g(x1)))) a(c(d(x1))) -> a(g(g(x1))) g(c(d(x1))) -> g(g(g(x1))) d(c(d(x1))) -> d(g(g(x1))) b(c(d(x1))) -> b(g(g(x1))) c(c(d(x1))) -> c(g(g(x1))) a(g(g(g(x1)))) -> a(b(b(x1))) g(g(g(g(x1)))) -> g(b(b(x1))) d(g(g(g(x1)))) -> d(b(b(x1))) b(g(g(g(x1)))) -> b(b(b(x1))) c(g(g(g(x1)))) -> c(b(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_{a_1}(x1)) -> a_{g_1}(g_{d_1}(d_{a_1}(x1))) a_{a_1}(a_{g_1}(x1)) -> a_{g_1}(g_{d_1}(d_{g_1}(x1))) a_{a_1}(a_{d_1}(x1)) -> a_{g_1}(g_{d_1}(d_{d_1}(x1))) popout

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

job log

popout

actions

all output return to SRS Stand 10685