details

property	value
status	timeout (cpu)
benchmark	jw5.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	Waldmann_06_SRS

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	301.016891003 seconds
cpu usage	1482.15172827
max memory	1.6524365824E10

stage attributes

unavailable

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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 25 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 5376 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 4269 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 2975 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 13 ms] (14) QDP (15) PisEmptyProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(a(b(b(x1)))) -> b(b(b(a(b(x1))))) b(a(a(b(b(x1))))) -> b(a(b(b(a(a(b(x1))))))) b(a(a(a(b(b(x1)))))) -> b(a(a(b(b(a(a(a(b(x1))))))))) b(a(a(a(a(b(b(x1))))))) -> b(a(a(a(b(b(a(a(a(a(b(x1))))))))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(a(b(x1)))) -> b(a(b(b(b(x1))))) b(b(a(a(b(x1))))) -> b(a(a(b(b(a(b(x1))))))) b(b(a(a(a(b(x1)))))) -> b(a(a(a(b(b(a(a(b(x1))))))))) b(b(a(a(a(a(b(x1))))))) -> b(a(a(a(a(b(b(a(a(a(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: b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) 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_{a_1}(a_{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}(a_{b_1}(b_{a_1}(x1))))))) 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_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))))))) 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_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))))))) b_{b_1}(b_{a_1}(a_{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_{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_{b_1}(b_{a_1}(a_{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_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))))))))) Q is empty. ---------------------------------------- (5) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: popout

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

job log

popout

actions

all output return to SRS Stand 10685