details

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

run statistics

property	value
solver	NTI_22
configuration	default
runtime (wallclock)	3.7883079052 seconds
cpu usage	4.89897198
max memory	2.1782528E8

stage attributes

key	value
output-size	2168
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... ## 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 = [h^#(cons(_0,_1)) -> h^#(g(cons(_0,_1)))] TRS = {f(s(_0)) -> f(_0), g(cons(0,_0)) -> g(_0), g(cons(s(_0),_1)) -> s(_0), h(cons(_0,_1)) -> h(g(cons(_0,_1)))} ## 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 = [g^#(cons(0,_0)) -> g^#(_0)] TRS = {f(s(_0)) -> f(_0), g(cons(0,_0)) -> g(_0), g(cons(s(_0),_1)) -> s(_0), h(cons(_0,_1)) -> h(g(cons(_0,_1)))} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [f^#(s(_0)) -> f^#(_0)] TRS = {f(s(_0)) -> f(_0), g(cons(0,_0)) -> g(_0), g(cons(s(_0),_1)) -> s(_0), h(cons(_0,_1)) -> h(g(cons(_0,_1)))} ## 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 = [h^#(cons(_0,_1)) -> h^#(g(cons(_0,_1)))] TRS = {f(s(_0)) -> f(_0), g(cons(0,_0)) -> g(_0), g(cons(s(_0),_1)) -> s(_0), h(cons(_0,_1)) -> h(g(cons(_0,_1)))} 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 = 216 popout

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

job log

popout

actions

all output return to TRS Standard