details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	188.673631191 seconds
cpu usage	745.753697552
max memory	1.5151550464E10

stage attributes

key	value
output-size	44882
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) RootLabelingProof [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 13 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) QDPOrderProof [EQUIVALENT, 7789 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 7073 ms] (14) QDP (15) PisEmptyProof [EQUIVALENT, 0 ms] (16) YES (17) QDP (18) SplitQDPProof [EQUIVALENT, 0 ms] (19) AND (20) QDP (21) SemLabProof [SOUND, 0 ms] (22) QDP (23) DependencyGraphProof [EQUIVALENT, 0 ms] (24) QDP (25) QDPOrderProof [EQUIVALENT, 18 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 13 ms] (28) QDP (29) PisEmptyProof [SOUND, 0 ms] (30) TRUE (31) QDP (32) QDPOrderProof [EQUIVALENT, 952 ms] (33) QDP (34) PisEmptyProof [EQUIVALENT, 0 ms] (35) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(a(a(b(x1))))) -> b(a(a(b(b(x1))))) b(a(a(a(b(b(b(x1))))))) -> b(b(b(a(a(a(b(x1))))))) b(a(b(a(a(b(x1)))))) -> b(a(b(b(a(a(a(b(x1)))))))) b(a(a(a(b(a(b(x1))))))) -> b(a(a(b(a(b(x1)))))) Q is empty. ---------------------------------------- (1) 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. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))))) -> b_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))))) -> b_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))))) b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))))))) b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))))))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: popout

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

job log

popout

actions

all output return to SRS Stand 10685