details

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

run statistics

property	value
solver	NTI_22
configuration	default
runtime (wallclock)	0.236982107162 seconds
cpu usage	0.240999669
max memory	3.3517568E7

stage attributes

key	value
output-size	2143
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... ## 2 initial DP problems to solve. ## First, we try to decompose these problems into smaller problems. ## Round 1 [2 DP problems]: ## DP problem: Dependency pairs = [i^#(.(_0,_1)) -> i^#(_1), i^#(.(_0,_1)) -> i^#(_0)] TRS = {.(1,_0) -> _0, .(_0,1) -> _0, .(i(_0),_0) -> 1, .(_0,i(_0)) -> 1, i(1) -> 1, i(i(_0)) -> _0, .(i(_0),.(_0,_1)) -> _1, .(_0,.(i(_0),_1)) -> _1, .(.(_0,_1),_2) -> .(_0,.(_1,_2)), i(.(_0,_1)) -> .(i(_1),i(_0))} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [.^#(.(_0,_1),_2) -> .^#(_0,.(_1,_2)), .^#(.(_0,_1),_2) -> .^#(_1,_2)] TRS = {.(1,_0) -> _0, .(_0,1) -> _0, .(i(_0),_0) -> 1, .(_0,i(_0)) -> 1, i(1) -> 1, i(i(_0)) -> _0, .(i(_0),.(_0,_1)) -> _1, .(_0,.(i(_0),_1)) -> _1, .(.(_0,_1),_2) -> .(_0,.(_1,_2)), i(.(_0,_1)) -> .(i(_1),i(_0))} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... The constraints are satisfied by the polynomials: {1:[0], i(_0):[_0], .(_0,_1):[1 + _0 + _1], .^#(_0,_1):[_0]} for all instantiations of the variables with values greater than or equal to mu = 0. 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