/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [SOUND, 0 ms] (2) QTRS (3) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(c) -> mark(f(g(c))) active(f(g(X))) -> mark(g(X)) proper(c) -> ok(c) proper(f(X)) -> f(proper(X)) proper(g(X)) -> g(proper(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The set Q consists of the following terms: active(c) active(f(g(x0))) proper(c) proper(f(x0)) proper(g(x0)) f(ok(x0)) g(ok(x0)) top(mark(x0)) top(ok(x0)) ---------------------------------------- (1) QTRS Reverse (SOUND) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c'(active(x)) -> c'(g(f(mark(x)))) g(f(active(X))) -> g(mark(X)) c'(proper(x)) -> c'(ok(x)) f(proper(X)) -> proper(f(X)) g(proper(X)) -> proper(g(X)) ok(f(X)) -> f(ok(X)) ok(g(X)) -> g(ok(X)) mark(top(X)) -> proper(top(X)) ok(top(X)) -> active(top(X)) Q is empty. ---------------------------------------- (3) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 5. This implies Q-termination of R. The following rules were used to construct the certificate: c'(active(x)) -> c'(g(f(mark(x)))) g(f(active(X))) -> g(mark(X)) c'(proper(x)) -> c'(ok(x)) f(proper(X)) -> proper(f(X)) g(proper(X)) -> proper(g(X)) ok(f(X)) -> f(ok(X)) ok(g(X)) -> g(ok(X)) mark(top(X)) -> proper(top(X)) ok(top(X)) -> active(top(X)) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 87, 90, 91, 93, 95 Node 50 is start node and node 51 is final node. Those nodes are connected through the following edges: * 50 to 52 labelled c'_1(0), f_1(0), g_1(0)* 50 to 54 labelled g_1(0)* 50 to 55 labelled proper_1(0), active_1(0)* 50 to 60 labelled c'_1(1)* 50 to 63 labelled proper_1(1)* 50 to 62 labelled g_1(1)* 50 to 69 labelled proper_1(2)* 50 to 74 labelled c'_1(2)* 50 to 91 labelled c'_1(3)* 51 to 51 labelled #_1(0)* 52 to 53 labelled g_1(0)* 52 to 51 labelled ok_1(0)* 52 to 56 labelled f_1(1), g_1(1)* 52 to 57 labelled active_1(1)* 52 to 65 labelled proper_1(1)* 52 to 68 labelled g_1(2)* 52 to 71 labelled proper_1(3)* 52 to 75 labelled proper_1(2)* 53 to 54 labelled f_1(0)* 53 to 64 labelled proper_1(1)* 54 to 51 labelled mark_1(0)* 54 to 57 labelled proper_1(1)* 55 to 51 labelled f_1(0), g_1(0), top_1(0)* 55 to 58 labelled proper_1(1)* 55 to 59 labelled g_1(1)* 55 to 66 labelled proper_1(2)* 56 to 51 labelled ok_1(1)* 56 to 56 labelled f_1(1), g_1(1)* 56 to 57 labelled active_1(1)* 56 to 68 labelled g_1(2)* 56 to 71 labelled proper_1(3)* 56 to 75 labelled proper_1(2)* 57 to 51 labelled top_1(1)* 58 to 51 labelled f_1(1), g_1(1)* 58 to 58 labelled proper_1(1)* 58 to 59 labelled g_1(1)* 58 to 66 labelled proper_1(2)* 59 to 51 labelled mark_1(1)* 59 to 57 labelled proper_1(1)* 60 to 61 labelled g_1(1)* 60 to 65 labelled ok_1(1)* 60 to 72 labelled proper_1(2)* 60 to 73 labelled g_1(2)* 60 to 71 labelled ok_1(1)* 60 to 75 labelled ok_1(1)* 60 to 78 labelled f_1(2), g_1(2)* 60 to 81 labelled g_1(3)* 60 to 84 labelled proper_1(4)* 61 to 62 labelled f_1(1)* 61 to 70 labelled proper_1(2)* 62 to 57 labelled mark_1(1)* 62 to 67 labelled proper_1(2)* 63 to 57 labelled g_1(1)* 63 to 65 labelled f_1(1), g_1(1)* 63 to 71 labelled f_1(1), g_1(1)* 63 to 75 labelled f_1(1), g_1(1)* 64 to 57 labelled f_1(1)* 65 to 64 labelled g_1(1)* 66 to 57 labelled g_1(2)* 67 to 51 labelled top_1(2)* 68 to 57 labelled mark_1(2)* 68 to 67 labelled proper_1(2)* 69 to 67 labelled g_1(2)* 70 to 67 labelled f_1(2)* 71 to 67 labelled g_1(3)* 72 to 70 labelled g_1(2)* 73 to 64 labelled ok_1(2)* 73 to 76 labelled f_1(2)* 73 to 67 labelled ok_1(2)* 73 to 80 labelled active_1(3)* 74 to 72 labelled ok_1(2)* 74 to 77 labelled g_1(3)* 74 to 85 labelled g_1(4)* 74 to 84 labelled ok_1(2)* 74 to 90 labelled proper_1(5)* 75 to 71 labelled f_1(2), g_1(2)* 75 to 75 labelled f_1(2), g_1(2)* 76 to 57 labelled ok_1(2)* 76 to 67 labelled active_1(2)* 77 to 70 labelled ok_1(3)* 77 to 79 labelled f_1(3)* 77 to 80 labelled ok_1(3)* 77 to 87 labelled active_1(4)* 78 to 71 labelled ok_1(2)* 78 to 75 labelled ok_1(2)* 78 to 79 labelled g_1(3)* 78 to 82 labelled f_1(3), g_1(3)* 79 to 67 labelled ok_1(3)* 79 to 80 labelled active_1(3)* 80 to 51 labelled top_1(3)* 81 to 67 labelled mark_1(3)* 81 to 80 labelled proper_1(3)* 82 to 71 labelled ok_1(3)* 82 to 75 labelled ok_1(3)* 82 to 83 labelled g_1(4)* 82 to 82 labelled f_1(3), g_1(3)* 83 to 67 labelled ok_1(4)* 83 to 80 labelled active_1(3)* 84 to 80 labelled g_1(4)* 85 to 80 labelled mark_1(4)* 85 to 87 labelled proper_1(4)* 87 to 51 labelled top_1(4)* 90 to 87 labelled g_1(5)* 91 to 90 labelled ok_1(3)* 91 to 93 labelled g_1(4)* 93 to 87 labelled ok_1(4)* 93 to 95 labelled active_1(5)* 95 to 51 labelled top_1(5) ---------------------------------------- (4) YES