Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487070440
details
property
value
status
complete
benchmark
Ex9_Luc06_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NTI-TC20-firstrun
configuration
Default 200
runtime (wallclock)
0.215406 seconds
cpu usage
0.361836
user time
0.312536
system time
0.0493
max virtual memory
113188.0
max residence set size
59260.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(n__a,n__b,n__b) -> f(n__a,n__b,n__b) Let l be the left-hand side and r be the right-hand side of this rule. Let p = epsilon, theta1 = {} and theta2 = {}. We have r|p = f(n__a,n__b,n__b) and theta2(theta1(l)) = theta1(r|p). Hence, the term theta1(l) = f(n__a,n__b,n__b) 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, 4 unfolded rules generated. # Iteration 2: no loop detected, 15 unfolded rules generated. # Iteration 3: no loop detected, 72 unfolded rules generated. # Iteration 4: loop detected, 2 unfolded rules generated. Here is the successful unfolding. Let IR be the TRS under analysis. L0 = f^#(n__a,_0,_0) -> f^#(activate(_0),b,n__b) is in U_IR^0. Let p0 = [0]. We unfold the rule of L0 forwards at position p0 with the rule activate(n__b) -> b. ==> L1 = f^#(n__a,n__b,n__b) -> f^#(b,b,n__b) is in U_IR^1. Let p1 = [0]. We unfold the rule of L1 forwards at position p1 with the rule b -> a. ==> L2 = f^#(n__a,n__b,n__b) -> f^#(a,b,n__b) is in U_IR^2. Let p2 = [0]. We unfold the rule of L2 forwards at position p2 with the rule a -> n__a. ==> L3 = f^#(n__a,n__b,n__b) -> f^#(n__a,b,n__b) is in U_IR^3. Let p3 = [1]. We unfold the rule of L3 forwards at position p3 with the rule b -> n__b. ==> L4 = f^#(n__a,n__b,n__b) -> f^#(n__a,n__b,n__b) is in U_IR^4. ** END proof description ** Proof stopped at iteration 4 Number of unfolded rules generated by this proof = 94 Number of unfolded rules generated by all the parallel proofs = 129
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard