details

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

run statistics

property	value
solver	NTI-TC20-firstrun
configuration	Default 200
runtime (wallclock)	6.53564 seconds
cpu usage	20.6418
user time	19.7572
system time	0.884595
max virtual memory	3.5399408E7
max residence set size	2419552.0

stage attributes

key	value
starexec-result	NO

output

NO Prover = TRS(tech=GUIDED_UNF_TRIPLES, nb_unfoldings=unlimited, unfold_variables=false, max_nb_coefficients=12, max_nb_unfolded_rules=-1, strategy=LEFTMOST_NE) ** BEGIN proof argument ** The following rule was generated while unfolding the analyzed TRS: [iteration = 12] eq(n__s(n__length(cons(_0,n__inf(_1)))),n__s(n__length(cons(_2,n__inf(_3))))) -> eq(n__s(n__length(cons(_1,n__inf(n__s(_1))))),n__s(n__length(cons(_3,n__inf(s(_3)))))) Let l be the left-hand side and r be the right-hand side of this rule. Let p = epsilon, theta1 = {} and theta2 = {_0->_1, _1->n__s(_1), _3->s(_3), _2->_3}. We have r|p = eq(n__s(n__length(cons(_1,n__inf(n__s(_1))))),n__s(n__length(cons(_3,n__inf(s(_3)))))) and theta2(theta1(l)) = theta1(r|p). Hence, the term theta1(l) = eq(n__s(n__length(cons(_0,n__inf(_1)))),n__s(n__length(cons(_2,n__inf(_3))))) loops w.r.t. the analyzed TRS. ** 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... ## Round 1: ## DP problem: Dependency pairs = [eq^#(n__s(_0),n__s(_1)) -> eq^#(activate(_0),activate(_1))] TRS = {eq(n__0,n__0) -> true, eq(n__s(_0),n__s(_1)) -> eq(activate(_0),activate(_1)), eq(_0,_1) -> false, inf(_0) -> cons(_0,n__inf(s(_0))), take(0,_0) -> nil, take(s(_0),cons(_1,_2)) -> cons(activate(_1),n__take(activate(_0),activate(_2))), length(nil) -> 0, length(cons(_0,_1)) -> s(n__length(activate(_1))), 0 -> n__0, s(_0) -> n__s(_0), inf(_0) -> n__inf(_0), take(_0,_1) -> n__take(_0,_1), length(_0) -> n__length(_0), activate(n__0) -> 0, activate(n__s(_0)) -> s(_0), activate(n__inf(_0)) -> inf(_0), activate(n__take(_0,_1)) -> take(_0,_1), activate(n__length(_0)) -> length(_0), activate(_0) -> _0} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Too many coefficients (36)! Aborting! ## Trying with lexicographic path orders... Failed! ## Trying to prove nontermination by unfolding the dependency pairs with the rules of the TRS # max_depth=3, unfold_variables=false: # Iteration 0: nontermination not detected, 1 unfolded rule generated. # Iteration 1: nontermination not detected, 1 unfolded rule generated. # Iteration 2: nontermination not detected, 3 unfolded rules generated. # Iteration 3: nontermination not detected, 6 unfolded rules generated. # Iteration 4: nontermination not detected, 3 unfolded rules generated. # Iteration 5: nontermination not detected, 0 unfolded rule generated. Nontermination not detected! # max_depth=3, unfold_variables=true: # Iteration 0: nontermination not detected, 1 unfolded rule generated. # Iteration 1: nontermination not detected, 1 unfolded rule generated. # Iteration 2: nontermination not detected, 3 unfolded rules generated. # Iteration 3: nontermination not detected, 6 unfolded rules generated. # Iteration 4: nontermination not detected, 3 unfolded rules generated. # Iteration 5: nontermination not detected, 0 unfolded rule generated. Nontermination not detected! # max_depth=4, unfold_variables=false: # Iteration 0: nontermination not detected, 1 unfolded rule generated. # Iteration 1: nontermination not detected, 1 unfolded rule generated. # Iteration 2: nontermination not detected, 3 unfolded rules generated. # Iteration 3: nontermination not detected, 4 unfolded rules generated. # Iteration 4: nontermination not detected, 6 unfolded rules generated. # Iteration 5: nontermination not detected, 7 unfolded rules generated. # Iteration 6: nontermination not detected, 11 unfolded rules generated. # Iteration 7: nontermination not detected, 5 unfolded rules generated. # Iteration 8: nontermination not detected, 9 unfolded rules generated. # Iteration 9: nontermination not detected, 5 unfolded rules generated. # Iteration 10: nontermination not detected, 0 unfolded rule generated. Nontermination not detected! # max_depth=4, unfold_variables=true: # Iteration 0: nontermination not detected, 1 unfolded rule generated. # Iteration 1: nontermination not detected, 1 unfolded rule generated. # Iteration 2: nontermination not detected, 3 unfolded rules generated. # Iteration 3: nontermination not detected, 4 unfolded rules generated. # Iteration 4: nontermination not detected, 6 unfolded rules generated. # Iteration 5: nontermination not detected, 7 unfolded rules generated. # Iteration 6: nontermination not detected, 11 unfolded rules generated. # Iteration 7: nontermination not detected, 5 unfolded rules generated. # Iteration 8: nontermination not detected, 9 unfolded rules generated. # Iteration 9: nontermination not detected, 5 unfolded rules generated. # Iteration 10: nontermination not detected, 0 unfolded rule generated. Nontermination not detected! # max_depth=5, unfold_variables=false: # Iteration 0: nontermination not detected, 1 unfolded rule generated. # Iteration 1: nontermination not detected, 1 unfolded rule generated. # Iteration 2: nontermination not detected, 3 unfolded rules generated. # Iteration 3: nontermination not detected, 4 unfolded rules generated. # Iteration 4: nontermination not detected, 10 unfolded rules generated. # Iteration 5: nontermination not detected, 21 unfolded rules generated. # Iteration 6: nontermination not detected, 53 unfolded rules generated. # Iteration 7: nontermination not detected, 37 unfolded rules generated. # Iteration 8: nontermination not detected, 87 unfolded rules generated. # Iteration 9: nontermination not detected, 159 unfolded rules generated. # Iteration 10: nontermination not detected, 25 unfolded rules generated. # Iteration 11: nontermination not detected, 1 unfolded rule generated. # Iteration 12: nontermination not detected, 0 unfolded rule generated. Nontermination not detected! # max_depth=5, unfold_variables=true: # Iteration 0: nontermination not detected, 1 unfolded rule generated. # Iteration 1: nontermination not detected, 1 unfolded rule generated. # Iteration 2: nontermination not detected, 3 unfolded rules generated. # Iteration 3: nontermination not detected, 4 unfolded rules generated. # Iteration 4: nontermination not detected, 10 unfolded rules generated. # Iteration 5: nontermination not detected, 21 unfolded rules generated. # Iteration 6: nontermination not detected, 53 unfolded rules generated. # Iteration 7: nontermination not detected, 37 unfolded rules generated. # Iteration 8: nontermination not detected, 87 unfolded rules generated. # Iteration 9: nontermination not detected, 159 unfolded rules generated. # Iteration 10: nontermination not detected, 25 unfolded rules generated. # Iteration 11: nontermination not detected, 1 unfolded rule generated. # Iteration 12: nontermination not detected, 0 unfolded rule generated. Nontermination not detected! popout

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

job log

popout

actions

all output return to TRS Standard