details

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

run statistics

property	value
solver	NTI_22
configuration	default
runtime (wallclock)	0.759316921234 seconds
cpu usage	1.754339368
max memory	4.26979328E8

stage attributes

key	value
output-size	2099
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 = [mark^#(f(_0,_1,_2)) -> mark^#(_1)] TRS = {a__f(a,_0,_0) -> a__f(_0,a__b,b), a__b -> a, mark(f(_0,_1,_2)) -> a__f(_0,mark(_1),_2), mark(b) -> a__b, mark(a) -> a, a__f(_0,_1,_2) -> f(_0,_1,_2), a__b -> b} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [a__f^#(a,_0,_0) -> a__f^#(_0,a__b,b)] TRS = {a__f(a,_0,_0) -> a__f(_0,a__b,b), a__b -> a, mark(f(_0,_1,_2)) -> a__f(_0,mark(_1),_2), mark(b) -> a__b, mark(a) -> a, a__f(_0,_1,_2) -> f(_0,_1,_2), a__b -> b} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... This DP problem is too complex! Aborting! ## Trying with lexicographic path orders... Failed! ## Trying with Knuth-Bendix orders... Failed! Don't know whether 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 = [a__f^#(a,_0,_0) -> a__f^#(_0,a__b,b)] TRS = {a__f(a,_0,_0) -> a__f(_0,a__b,b), a__b -> a, mark(f(_0,_1,_2)) -> a__f(_0,mark(_1),_2), mark(b) -> a__b, mark(a) -> a, a__f(_0,_1,_2) -> f(_0,_1,_2), a__b -> b} 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 = 948 popout

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

job log

popout

actions

all output return to TRS Standard