details

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

run statistics

property	value
solver	NTI-TC20-firstrun
configuration	Default 200
runtime (wallclock)	1.00244 seconds
cpu usage	2.79203
user time	2.61341
system time	0.178618
max virtual memory	3.5396896E7
max residence set size	602496.0

stage attributes

key	value
starexec-result	DONT KNOW

output

DON'T KNOW Prover = TRS(tech=PATTERN_RULES, nb_unfoldings=unlimited, max_nb_unfolded_rules=200) ** 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... ## Round 1: ## DP problem: Dependency pairs = [a^#(f,a(f,_0)) -> a^#(_0,_0), a^#(h,_0) -> a^#(f,_0), a^#(h,_0) -> a^#(f,a(g,a(f,_0)))] TRS = {a(f,a(f,_0)) -> a(_0,_0), a(h,_0) -> a(f,a(g,a(f,_0)))} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Failed! ## Trying with lexicographic path orders... Failed! ## Trying to prove nontermination by unfolding the dependency pairs with the rules of the TRS # Iteration 0: nontermination not detected, 3 unfolded rules generated. # Iteration 1: nontermination not detected, 4 unfolded rules generated. # Iteration 2: nontermination not detected, 3 unfolded rules generated. # Iteration 3: nontermination not detected, 0 unfolded rule generated. Nontermination not detected! Don't know whether this DP problem is finite. Could not solve the following DP problems: 1: Dependency pairs = [a^#(f,a(f,_0)) -> a^#(_0,_0), a^#(h,_0) -> a^#(f,_0), a^#(h,_0) -> a^#(f,a(g,a(f,_0)))] TRS = {a(f,a(f,_0)) -> a(_0,_0), a(h,_0) -> a(f,a(g,a(f,_0)))} Hence, could not prove (non)termination of the TRS under analysis. ** END proof description ** Proof stopped at iteration 3 Number of unfolded rules generated by this proof = 10 Number of unfolded rules generated by all the parallel proofs = 1036 popout

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

job log

popout

actions

all output return to TRS Standard