details

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

run statistics

property	value
solver	NTI_22
configuration	default
runtime (wallclock)	0.230991840363 seconds
cpu usage	0.223154368
max memory	3.2477184E7

stage attributes

key	value
output-size	2813
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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... ## 3 initial DP problems to solve. ## First, we try to decompose these problems into smaller problems. ## Round 1 [3 DP problems]: ## DP problem: Dependency pairs = [div^#(s(_0),s(_1)) -> div^#(minus(_0,_1),s(_1))] TRS = {minus(0,_0) -> 0, minus(s(_0),s(_1)) -> minus(_0,_1), geq(_0,0) -> true, geq(0,s(_0)) -> false, geq(s(_0),s(_1)) -> geq(_0,_1), div(0,s(_0)) -> 0, div(s(_0),s(_1)) -> if(geq(_0,_1),s(div(minus(_0,_1),s(_1))),0), if(true,_0,_1) -> _0, if(false,_0,_1) -> _1} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... This DP problem is too complex! Aborting! ## Trying with lexicographic path orders... The constraints are satisfied by the lexicographic path order using the argument filtering: {if:[0, 1, 2], geq:[0, 1], div:[0, 1], s:[0], minus:[0], div^#:[0, 1]} and the precedence: div > [false, true, if, geq, s, minus, 0], s > [false, true, minus, 0], 0 > [false, true] This DP problem is finite. ## DP problem: Dependency pairs = [geq^#(s(_0),s(_1)) -> geq^#(_0,_1)] TRS = {minus(0,_0) -> 0, minus(s(_0),s(_1)) -> minus(_0,_1), geq(_0,0) -> true, geq(0,s(_0)) -> false, geq(s(_0),s(_1)) -> geq(_0,_1), div(0,s(_0)) -> 0, div(s(_0),s(_1)) -> if(geq(_0,_1),s(div(minus(_0,_1),s(_1))),0), if(true,_0,_1) -> _0, if(false,_0,_1) -> _1} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [minus^#(s(_0),s(_1)) -> minus^#(_0,_1)] TRS = {minus(0,_0) -> 0, minus(s(_0),s(_1)) -> minus(_0,_1), geq(_0,0) -> true, geq(0,s(_0)) -> false, geq(s(_0),s(_1)) -> geq(_0,_1), div(0,s(_0)) -> 0, div(s(_0),s(_1)) -> if(geq(_0,_1),s(div(minus(_0,_1),s(_1))),0), if(true,_0,_1) -> _0, if(false,_0,_1) -> _1} ## 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 popout

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

job log

popout

actions

all output return to TRS Standard