details

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

run statistics

property	value
solver	NTI-TC20-firstrun
configuration	Default 200
runtime (wallclock)	0.638039 seconds
cpu usage	1.73406
user time	1.61466
system time	0.119402
max virtual memory	3.5396896E7
max residence set size	313896.0

stage attributes

key	value
starexec-result	NO

output

NO Prover = TRS(tech=GUIDED_UNF, nb_unfoldings=unlimited, unfold_variables=true, strategy=LEFTMOST_NE) ** BEGIN proof argument ** The following rule was generated while unfolding the analyzed TRS: [iteration = 4] f(g(0,_0,_0),g(2,1,1),g(0,_0,_0)) -> f(g(0,_0,_0),g(2,_0,_0),g(0,_0,_0)) Let l be the left-hand side and r be the right-hand side of this rule. Let p = epsilon, theta1 = {_0->1} and theta2 = {}. We have r|p = f(g(0,_0,_0),g(2,_0,_0),g(0,_0,_0)) and theta2(theta1(l)) = theta1(r|p). Hence, the term theta1(l) = f(g(0,1,1),g(2,1,1),g(0,1,1)) 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! ## Searching for a loop by unfolding (unfolding of variable subterms: ON)... # Iteration 0: no loop detected, 1 unfolded rule generated. # Iteration 1: no loop detected, 5 unfolded rules generated. # Iteration 2: no loop detected, 26 unfolded rules generated. # Iteration 3: no loop detected, 159 unfolded rules generated. # Iteration 4: loop detected, 1154 unfolded rules generated. Here is the successful unfolding. Let IR be the TRS under analysis. L0 = f^#(0,1,_0) -> f^#(_0,_0,_0) is in U_IR^0. Let p0 = [0]. We unfold the rule of L0 backwards at position p0 with the rule g(_0,_1,_1) -> _0. ==> L1 = f^#(g(0,_0,_0),1,g(0,_0,_0)) -> f^#(g(0,_0,_0),g(0,_0,_0),g(0,_0,_0)) is in U_IR^1. Let p1 = [1]. We unfold the rule of L1 backwards at position p1 with the rule g(_0,_0,_1) -> _1. ==> L2 = f^#(g(0,_0,_0),g(_1,_1,1),g(0,_0,_0)) -> f^#(g(0,_0,_0),g(0,_0,_0),g(0,_0,_0)) is in U_IR^2. Let p2 = [1, 0]. We unfold the rule of L2 forwards at position p2 with the rule 0 -> 2. ==> L3 = f^#(g(0,_0,_0),g(2,2,1),g(0,_0,_0)) -> f^#(g(0,_0,_0),g(2,_0,_0),g(0,_0,_0)) is in U_IR^3. Let p3 = [1, 1]. We unfold the rule of L3 backwards at position p3 with the rule 1 -> 2. ==> L4 = f^#(g(0,1,1),g(2,1,1),g(0,1,1)) -> f^#(g(0,1,1),g(2,1,1),g(0,1,1)) is in U_IR^4. ** END proof description ** Proof stopped at iteration 4 Number of unfolded rules generated by this proof = 1345 Number of unfolded rules generated by all the parallel proofs = 2373 popout

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

job log

popout

actions

all output return to TRS Standard