4.06/1.98 YES 4.06/1.98 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 4.06/1.98 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.06/1.98 4.06/1.98 4.06/1.98 Termination of the given ETRS could be proven: 4.06/1.98 4.06/1.98 (0) ETRS 4.06/1.98 (1) EquationalDependencyPairsProof [EQUIVALENT, 0 ms] 4.06/1.98 (2) EDP 4.06/1.98 (3) EDependencyGraphProof [EQUIVALENT, 0 ms] 4.06/1.98 (4) AND 4.06/1.98 (5) EDP 4.06/1.98 (6) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 4.06/1.98 (7) EDP 4.06/1.98 (8) EUsableRulesReductionPairsProof [EQUIVALENT, 4 ms] 4.06/1.98 (9) EDP 4.06/1.98 (10) PisEmptyProof [EQUIVALENT, 0 ms] 4.06/1.98 (11) YES 4.06/1.98 (12) EDP 4.06/1.98 (13) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 4.06/1.98 (14) EDP 4.06/1.98 (15) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 4.06/1.98 (16) EDP 4.06/1.98 (17) PisEmptyProof [EQUIVALENT, 0 ms] 4.06/1.98 (18) YES 4.06/1.98 (19) EDP 4.06/1.98 (20) EDPPoloProof [EQUIVALENT, 0 ms] 4.06/1.98 (21) EDP 4.06/1.98 (22) EDependencyGraphProof [EQUIVALENT, 0 ms] 4.06/1.98 (23) TRUE 4.06/1.98 4.06/1.98 4.06/1.98 ---------------------------------------- 4.06/1.98 4.06/1.98 (0) 4.06/1.98 Obligation: 4.06/1.98 Equational rewrite system: 4.06/1.98 The TRS R consists of the following rules: 4.06/1.98 4.06/1.98 le(0, y) -> true 4.06/1.98 le(s(x), 0) -> false 4.06/1.98 le(s(x), s(y)) -> le(x, y) 4.06/1.98 minus(x, 0) -> x 4.06/1.98 minus(s(x), s(y)) -> minus(x, y) 4.06/1.98 gcd(0, y) -> y 4.06/1.98 gcd(s(x), 0) -> s(x) 4.06/1.98 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.98 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.98 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.98 4.06/1.98 The set E consists of the following equations: 4.06/1.98 4.06/1.98 gcd(x, y) == gcd(y, x) 4.06/1.98 4.06/1.98 4.06/1.98 ---------------------------------------- 4.06/1.98 4.06/1.98 (1) EquationalDependencyPairsProof (EQUIVALENT) 4.06/1.98 Using Dependency Pairs [AG00,DA_STEIN] we result in the following initial EDP problem: 4.06/1.98 The TRS P consists of the following rules: 4.06/1.98 4.06/1.98 LE(s(x), s(y)) -> LE(x, y) 4.06/1.98 MINUS(s(x), s(y)) -> MINUS(x, y) 4.06/1.98 GCD(s(x), s(y)) -> IF_GCD(le(y, x), s(x), s(y)) 4.06/1.98 GCD(s(x), s(y)) -> LE(y, x) 4.06/1.98 IF_GCD(true, s(x), s(y)) -> GCD(minus(x, y), s(y)) 4.06/1.98 IF_GCD(true, s(x), s(y)) -> MINUS(x, y) 4.06/1.98 IF_GCD(false, s(x), s(y)) -> GCD(minus(y, x), s(x)) 4.06/1.98 IF_GCD(false, s(x), s(y)) -> MINUS(y, x) 4.06/1.98 4.06/1.98 The TRS R consists of the following rules: 4.06/1.98 4.06/1.98 le(0, y) -> true 4.06/1.98 le(s(x), 0) -> false 4.06/1.98 le(s(x), s(y)) -> le(x, y) 4.06/1.98 minus(x, 0) -> x 4.06/1.98 minus(s(x), s(y)) -> minus(x, y) 4.06/1.98 gcd(0, y) -> y 4.06/1.98 gcd(s(x), 0) -> s(x) 4.06/1.98 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.98 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.98 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.98 4.06/1.98 The set E consists of the following equations: 4.06/1.98 4.06/1.98 gcd(x, y) == gcd(y, x) 4.06/1.98 4.06/1.98 The set E# consists of the following equations: 4.06/1.98 4.06/1.98 GCD(x, y) == GCD(y, x) 4.06/1.98 4.06/1.98 We have to consider all minimal (P,E#,R,E)-chains 4.06/1.98 4.06/1.98 ---------------------------------------- 4.06/1.98 4.06/1.98 (2) 4.06/1.98 Obligation: 4.06/1.98 The TRS P consists of the following rules: 4.06/1.98 4.06/1.98 LE(s(x), s(y)) -> LE(x, y) 4.06/1.98 MINUS(s(x), s(y)) -> MINUS(x, y) 4.06/1.98 GCD(s(x), s(y)) -> IF_GCD(le(y, x), s(x), s(y)) 4.06/1.98 GCD(s(x), s(y)) -> LE(y, x) 4.06/1.98 IF_GCD(true, s(x), s(y)) -> GCD(minus(x, y), s(y)) 4.06/1.98 IF_GCD(true, s(x), s(y)) -> MINUS(x, y) 4.06/1.98 IF_GCD(false, s(x), s(y)) -> GCD(minus(y, x), s(x)) 4.06/1.98 IF_GCD(false, s(x), s(y)) -> MINUS(y, x) 4.06/1.98 4.06/1.98 The TRS R consists of the following rules: 4.06/1.99 4.06/1.99 le(0, y) -> true 4.06/1.99 le(s(x), 0) -> false 4.06/1.99 le(s(x), s(y)) -> le(x, y) 4.06/1.99 minus(x, 0) -> x 4.06/1.99 minus(s(x), s(y)) -> minus(x, y) 4.06/1.99 gcd(0, y) -> y 4.06/1.99 gcd(s(x), 0) -> s(x) 4.06/1.99 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.99 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.99 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.99 4.06/1.99 The set E consists of the following equations: 4.06/1.99 4.06/1.99 gcd(x, y) == gcd(y, x) 4.06/1.99 4.06/1.99 The set E# consists of the following equations: 4.06/1.99 4.06/1.99 GCD(x, y) == GCD(y, x) 4.06/1.99 4.06/1.99 We have to consider all minimal (P,E#,R,E)-chains 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (3) EDependencyGraphProof (EQUIVALENT) 4.06/1.99 The approximation of the Equational Dependency Graph [DA_STEIN] contains 3 SCCs with 3 less nodes. 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (4) 4.06/1.99 Complex Obligation (AND) 4.06/1.99 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (5) 4.06/1.99 Obligation: 4.06/1.99 The TRS P consists of the following rules: 4.06/1.99 4.06/1.99 MINUS(s(x), s(y)) -> MINUS(x, y) 4.06/1.99 4.06/1.99 The TRS R consists of the following rules: 4.06/1.99 4.06/1.99 le(0, y) -> true 4.06/1.99 le(s(x), 0) -> false 4.06/1.99 le(s(x), s(y)) -> le(x, y) 4.06/1.99 minus(x, 0) -> x 4.06/1.99 minus(s(x), s(y)) -> minus(x, y) 4.06/1.99 gcd(0, y) -> y 4.06/1.99 gcd(s(x), 0) -> s(x) 4.06/1.99 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.99 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.99 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.99 4.06/1.99 The set E consists of the following equations: 4.06/1.99 4.06/1.99 gcd(x, y) == gcd(y, x) 4.06/1.99 4.06/1.99 The set E# consists of the following equations: 4.06/1.99 4.06/1.99 GCD(x, y) == GCD(y, x) 4.06/1.99 4.06/1.99 We have to consider all minimal (P,E#,R,E)-chains 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (6) ESharpUsableEquationsProof (EQUIVALENT) 4.06/1.99 We can delete the following equations of E# with the esharp usable equations processor[DA_STEIN]: 4.06/1.99 GCD(x, y) == GCD(y, x) 4.06/1.99 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (7) 4.06/1.99 Obligation: 4.06/1.99 The TRS P consists of the following rules: 4.06/1.99 4.06/1.99 MINUS(s(x), s(y)) -> MINUS(x, y) 4.06/1.99 4.06/1.99 The TRS R consists of the following rules: 4.06/1.99 4.06/1.99 le(0, y) -> true 4.06/1.99 le(s(x), 0) -> false 4.06/1.99 le(s(x), s(y)) -> le(x, y) 4.06/1.99 minus(x, 0) -> x 4.06/1.99 minus(s(x), s(y)) -> minus(x, y) 4.06/1.99 gcd(0, y) -> y 4.06/1.99 gcd(s(x), 0) -> s(x) 4.06/1.99 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.99 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.99 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.99 4.06/1.99 The set E consists of the following equations: 4.06/1.99 4.06/1.99 gcd(x, y) == gcd(y, x) 4.06/1.99 4.06/1.99 E# is empty. 4.06/1.99 We have to consider all minimal (P,E#,R,E)-chains 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (8) EUsableRulesReductionPairsProof (EQUIVALENT) 4.06/1.99 By using the improved usable rules and equations with reduction pair processor [DA_STEIN] with a polynomial ordering [POLO], all dependency pairs and the corresponding improved usable rules can be oriented non-strictly, the improved usable equations and the esharp equations can be oriented equivalently. All non-usable rules and equations are removed, and those dependency pairs and improved usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well. 4.06/1.99 4.06/1.99 The following dependency pairs can be deleted: 4.06/1.99 4.06/1.99 MINUS(s(x), s(y)) -> MINUS(x, y) 4.06/1.99 The following rules are removed from R: 4.06/1.99 4.06/1.99 le(0, y) -> true 4.06/1.99 le(s(x), 0) -> false 4.06/1.99 le(s(x), s(y)) -> le(x, y) 4.06/1.99 minus(x, 0) -> x 4.06/1.99 minus(s(x), s(y)) -> minus(x, y) 4.06/1.99 gcd(0, y) -> y 4.06/1.99 gcd(s(x), 0) -> s(x) 4.06/1.99 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.99 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.99 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.99 The following equations are removed from E: 4.06/1.99 4.06/1.99 gcd(x, y) == gcd(y, x) 4.06/1.99 Used ordering: POLO with Polynomial interpretation [POLO]: 4.06/1.99 4.06/1.99 POL(MINUS(x_1, x_2)) = 3*x_1 + 3*x_2 4.06/1.99 POL(s(x_1)) = x_1 4.06/1.99 4.06/1.99 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (9) 4.06/1.99 Obligation: 4.06/1.99 P is empty. 4.06/1.99 R is empty. 4.06/1.99 E is empty. 4.06/1.99 E# is empty. 4.06/1.99 We have to consider all minimal (P,E#,R,E)-chains 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (10) PisEmptyProof (EQUIVALENT) 4.06/1.99 The TRS P is empty. Hence, there is no (P,E#,R,E) chain. 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (11) 4.06/1.99 YES 4.06/1.99 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (12) 4.06/1.99 Obligation: 4.06/1.99 The TRS P consists of the following rules: 4.06/1.99 4.06/1.99 LE(s(x), s(y)) -> LE(x, y) 4.06/1.99 4.06/1.99 The TRS R consists of the following rules: 4.06/1.99 4.06/1.99 le(0, y) -> true 4.06/1.99 le(s(x), 0) -> false 4.06/1.99 le(s(x), s(y)) -> le(x, y) 4.06/1.99 minus(x, 0) -> x 4.06/1.99 minus(s(x), s(y)) -> minus(x, y) 4.06/1.99 gcd(0, y) -> y 4.06/1.99 gcd(s(x), 0) -> s(x) 4.06/1.99 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.99 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.99 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.99 4.06/1.99 The set E consists of the following equations: 4.06/1.99 4.06/1.99 gcd(x, y) == gcd(y, x) 4.06/1.99 4.06/1.99 The set E# consists of the following equations: 4.06/1.99 4.06/1.99 GCD(x, y) == GCD(y, x) 4.06/1.99 4.06/1.99 We have to consider all minimal (P,E#,R,E)-chains 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (13) ESharpUsableEquationsProof (EQUIVALENT) 4.06/1.99 We can delete the following equations of E# with the esharp usable equations processor[DA_STEIN]: 4.06/1.99 GCD(x, y) == GCD(y, x) 4.06/1.99 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (14) 4.06/1.99 Obligation: 4.06/1.99 The TRS P consists of the following rules: 4.06/1.99 4.06/1.99 LE(s(x), s(y)) -> LE(x, y) 4.06/1.99 4.06/1.99 The TRS R consists of the following rules: 4.06/1.99 4.06/1.99 le(0, y) -> true 4.06/1.99 le(s(x), 0) -> false 4.06/1.99 le(s(x), s(y)) -> le(x, y) 4.06/1.99 minus(x, 0) -> x 4.06/1.99 minus(s(x), s(y)) -> minus(x, y) 4.06/1.99 gcd(0, y) -> y 4.06/1.99 gcd(s(x), 0) -> s(x) 4.06/1.99 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.99 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.99 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.99 4.06/1.99 The set E consists of the following equations: 4.06/1.99 4.06/1.99 gcd(x, y) == gcd(y, x) 4.06/1.99 4.06/1.99 E# is empty. 4.06/1.99 We have to consider all minimal (P,E#,R,E)-chains 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (15) EUsableRulesReductionPairsProof (EQUIVALENT) 4.06/1.99 By using the improved usable rules and equations with reduction pair processor [DA_STEIN] with a polynomial ordering [POLO], all dependency pairs and the corresponding improved usable rules can be oriented non-strictly, the improved usable equations and the esharp equations can be oriented equivalently. All non-usable rules and equations are removed, and those dependency pairs and improved usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well. 4.06/1.99 4.06/1.99 The following dependency pairs can be deleted: 4.06/1.99 4.06/1.99 LE(s(x), s(y)) -> LE(x, y) 4.06/1.99 The following rules are removed from R: 4.06/1.99 4.06/1.99 le(0, y) -> true 4.06/1.99 le(s(x), 0) -> false 4.06/1.99 le(s(x), s(y)) -> le(x, y) 4.06/1.99 minus(x, 0) -> x 4.06/1.99 minus(s(x), s(y)) -> minus(x, y) 4.06/1.99 gcd(0, y) -> y 4.06/1.99 gcd(s(x), 0) -> s(x) 4.06/1.99 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.99 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.99 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.99 The following equations are removed from E: 4.06/1.99 4.06/1.99 gcd(x, y) == gcd(y, x) 4.06/1.99 Used ordering: POLO with Polynomial interpretation [POLO]: 4.06/1.99 4.06/1.99 POL(LE(x_1, x_2)) = 3*x_1 + 3*x_2 4.06/1.99 POL(s(x_1)) = x_1 4.06/1.99 4.06/1.99 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (16) 4.06/1.99 Obligation: 4.06/1.99 P is empty. 4.06/1.99 R is empty. 4.06/1.99 E is empty. 4.06/1.99 E# is empty. 4.06/1.99 We have to consider all minimal (P,E#,R,E)-chains 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (17) PisEmptyProof (EQUIVALENT) 4.06/1.99 The TRS P is empty. Hence, there is no (P,E#,R,E) chain. 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (18) 4.06/1.99 YES 4.06/1.99 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (19) 4.06/1.99 Obligation: 4.06/1.99 The TRS P consists of the following rules: 4.06/1.99 4.06/1.99 IF_GCD(false, s(x), s(y)) -> GCD(minus(y, x), s(x)) 4.06/1.99 GCD(s(x), s(y)) -> IF_GCD(le(y, x), s(x), s(y)) 4.06/1.99 IF_GCD(true, s(x), s(y)) -> GCD(minus(x, y), s(y)) 4.06/1.99 4.06/1.99 The TRS R consists of the following rules: 4.06/1.99 4.06/1.99 le(0, y) -> true 4.06/1.99 le(s(x), 0) -> false 4.06/1.99 le(s(x), s(y)) -> le(x, y) 4.06/1.99 minus(x, 0) -> x 4.06/1.99 minus(s(x), s(y)) -> minus(x, y) 4.06/1.99 gcd(0, y) -> y 4.06/1.99 gcd(s(x), 0) -> s(x) 4.06/1.99 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.99 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.99 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.99 4.06/1.99 The set E consists of the following equations: 4.06/1.99 4.06/1.99 gcd(x, y) == gcd(y, x) 4.06/1.99 4.06/1.99 The set E# consists of the following equations: 4.06/1.99 4.06/1.99 GCD(x, y) == GCD(y, x) 4.06/1.99 4.06/1.99 We have to consider all minimal (P,E#,R,E)-chains 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (20) EDPPoloProof (EQUIVALENT) 4.06/1.99 We use the reduction pair processor [DA_STEIN] with a polynomial ordering [POLO]. The following set of Dependency Pairs of this DP problem can be strictly oriented. 4.06/1.99 4.06/1.99 4.06/1.99 GCD(s(x), s(y)) -> IF_GCD(le(y, x), s(x), s(y)) 4.06/1.99 The remaining Dependency Pairs were at least non-strictly oriented. 4.06/1.99 4.06/1.99 4.06/1.99 IF_GCD(false, s(x), s(y)) -> GCD(minus(y, x), s(x)) 4.06/1.99 IF_GCD(true, s(x), s(y)) -> GCD(minus(x, y), s(y)) 4.06/1.99 With the implicit AFS we had to orient the following set of usable rules of R non-strictly. 4.06/1.99 4.06/1.99 4.06/1.99 minus(s(x), s(y)) -> minus(x, y) 4.06/1.99 minus(x, 0) -> x 4.06/1.99 We had to orient the following equations of E# equivalently. 4.06/1.99 4.06/1.99 4.06/1.99 GCD(x, y) == GCD(y, x) 4.06/1.99 With the implicit AFS there is no usable equation of E. 4.06/1.99 4.06/1.99 4.06/1.99 Used ordering: POLO with Polynomial interpretation [POLO]: 4.06/1.99 4.06/1.99 POL(0) = 0 4.06/1.99 POL(GCD(x_1, x_2)) = 2 + 2*x_1 + 2*x_2 4.06/1.99 POL(IF_GCD(x_1, x_2, x_3)) = 2*x_2 + 2*x_3 4.06/1.99 POL(false) = 0 4.06/1.99 POL(le(x_1, x_2)) = 0 4.06/1.99 POL(minus(x_1, x_2)) = 1 + x_1 4.06/1.99 POL(s(x_1)) = 2 + x_1 4.06/1.99 POL(true) = 0 4.06/1.99 4.06/1.99 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (21) 4.06/1.99 Obligation: 4.06/1.99 The TRS P consists of the following rules: 4.06/1.99 4.06/1.99 IF_GCD(false, s(x), s(y)) -> GCD(minus(y, x), s(x)) 4.06/1.99 IF_GCD(true, s(x), s(y)) -> GCD(minus(x, y), s(y)) 4.06/1.99 4.06/1.99 The TRS R consists of the following rules: 4.06/1.99 4.06/1.99 le(0, y) -> true 4.06/1.99 le(s(x), 0) -> false 4.06/1.99 le(s(x), s(y)) -> le(x, y) 4.06/1.99 minus(x, 0) -> x 4.06/1.99 minus(s(x), s(y)) -> minus(x, y) 4.06/1.99 gcd(0, y) -> y 4.06/1.99 gcd(s(x), 0) -> s(x) 4.06/1.99 gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y)) 4.06/1.99 if_gcd(true, s(x), s(y)) -> gcd(minus(x, y), s(y)) 4.06/1.99 if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x)) 4.06/1.99 4.06/1.99 The set E consists of the following equations: 4.06/1.99 4.06/1.99 gcd(x, y) == gcd(y, x) 4.06/1.99 4.06/1.99 The set E# consists of the following equations: 4.06/1.99 4.06/1.99 GCD(x, y) == GCD(y, x) 4.06/1.99 4.06/1.99 We have to consider all minimal (P,E#,R,E)-chains 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (22) EDependencyGraphProof (EQUIVALENT) 4.06/1.99 The approximation of the Equational Dependency Graph [DA_STEIN] contains 0 SCCs with 2 less nodes. 4.06/1.99 ---------------------------------------- 4.06/1.99 4.06/1.99 (23) 4.06/1.99 TRUE 4.29/2.01 EOF