details

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

run statistics

property	value
solver	NTI_22
configuration	default
runtime (wallclock)	0.493984937668 seconds
cpu usage	0.974787762
max memory	9.244672E7

stage attributes

key	value
output-size	1873
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE ** 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 = [f^#(_0,s(_1)) -> f^#(d(_0),_1), f^#(_0,0) -> f^#(s(0),_0)] TRS = {f(_0,s(_1)) -> f(d(_0),_1), f(_0,0) -> f(s(0),_0), d(0) -> 0, d(s(_0)) -> s(s(d(_0)))} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Failed! ## Trying with lexicographic path orders... Failed! ## Trying with Knuth-Bendix orders... Failed! Don't know whether this DP problem is finite. ## DP problem: Dependency pairs = [d^#(s(_0)) -> d^#(_0)] TRS = {f(_0,s(_1)) -> f(d(_0),_1), f(_0,0) -> f(s(0),_0), d(0) -> 0, d(s(_0)) -> s(s(d(_0)))} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## A DP problem could not be proved finite. ## Now, we try to prove that this problem is infinite. ## Could not solve the following DP problems: 1: Dependency pairs = [f^#(_0,s(_1)) -> f^#(d(_0),_1), f^#(_0,0) -> f^#(s(0),_0)] TRS = {f(_0,s(_1)) -> f(d(_0),_1), f(_0,0) -> f(s(0),_0), d(0) -> 0, d(s(_0)) -> s(s(d(_0)))} Hence, could not prove (non)termination of the TRS under analysis. 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 = 363 popout

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

job log

popout

actions

all output return to TRS Standard