/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES ** BEGIN proof argument ** All the DP problems were proved finite. As all the involved DP processors are sound, the TRS under analysis terminates. ** END proof argument ** ** BEGIN proof description ** ## Searching for a generalized rewrite rule (a rule whose right-hand side contains a variable that does not occur in the left-hand side)... No generalized rewrite rule found! ## Applying the DP framework... ## 1 initial DP problem to solve. ## First, we try to decompose this problem into smaller problems. ## Round 1 [1 DP problem]: ## DP problem: Dependency pairs = [if^#(if(_0,_1,_2),_3,_4) -> if^#(_0,if(_1,_3,_4),if(_2,_3,_4)), if^#(if(_0,_1,_2),_3,_4) -> if^#(_1,_3,_4), if^#(if(_0,_1,_2),_3,_4) -> if^#(_2,_3,_4), if^#(_0,if(_0,_1,_2),_2) -> if^#(_0,_1,_2), if^#(_0,_1,if(_0,_1,_2)) -> if^#(_0,_1,_2)] TRS = {if(true,_0,_1) -> _0, if(false,_0,_1) -> _1, if(_0,_1,_1) -> _1, if(if(_0,_1,_2),_3,_4) -> if(_0,if(_1,_3,_4),if(_2,_3,_4)), if(_0,if(_0,_1,_2),_2) -> if(_0,_1,_2), if(_0,_1,if(_0,_1,_2)) -> if(_0,_1,_2)} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Successfully decomposed the DP problem into 1 smaller problem to solve! ## Round 2 [1 DP problem]: ## DP problem: Dependency pairs = [if^#(_0,if(_0,_1,_2),_2) -> if^#(_0,_1,_2), if^#(_0,_1,if(_0,_1,_2)) -> if^#(_0,_1,_2)] TRS = {if(true,_0,_1) -> _0, if(false,_0,_1) -> _1, if(_0,_1,_1) -> _1, if(if(_0,_1,_2),_3,_4) -> if(_0,if(_1,_3,_4),if(_2,_3,_4)), if(_0,if(_0,_1,_2),_2) -> if(_0,_1,_2), if(_0,_1,if(_0,_1,_2)) -> if(_0,_1,_2)} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## All the DP problems were proved finite. As all the involved DP processors are sound, the TRS under analysis terminates. Proof run on Linux version 3.10.0-1160.25.1.el7.x86_64 for amd64 using Java version 1.8.0_292 ** END proof description ** Total number of generated unfolded rules = 0