Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487069860
details
property
value
status
complete
benchmark
Ex14_AEGL02_FR.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)
0.351745 seconds
cpu usage
0.920684
user time
0.849677
system time
0.071007
max virtual memory
113188.0
max residence set size
119036.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 = 5] length(n__cons(_0,n__from(_1))) -> length(n__cons(activate(_1),n__from(n__s(activate(_1))))) Let l be the left-hand side and r be the right-hand side of this rule. Let p = epsilon, theta1 = {} and theta2 = {_0->activate(_1), _1->n__s(activate(_1))}. We have r|p = length(n__cons(activate(_1),n__from(n__s(activate(_1))))) and theta2(theta1(l)) = theta1(r|p). Hence, the term theta1(l) = length(n__cons(_0,n__from(_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, 1 unfolded rule generated. # Iteration 2: no loop detected, 8 unfolded rules generated. # Iteration 3: no loop detected, 64 unfolded rules generated. # Iteration 4: no loop detected, 612 unfolded rules generated. # Iteration 5: loop detected, 1 unfolded rule generated. Here is the successful unfolding. Let IR be the TRS under analysis. L0 = [length^#(n__cons(_0,_1)) -> length1^#(activate(_1)), length1^#(_2) -> length^#(activate(_2))] is in U_IR^0. We merge the first and the second rule of L0. ==> L1 = length^#(n__cons(_0,_1)) -> length^#(activate(activate(_1))) is in U_IR^1. Let p1 = [0]. We unfold the rule of L1 forwards at position p1 with the rule activate(_0) -> _0. ==> L2 = length^#(n__cons(_0,_1)) -> length^#(activate(_1)) is in U_IR^2. Let p2 = [0]. We unfold the rule of L2 forwards at position p2 with the rule activate(n__from(_0)) -> from(activate(_0)). ==> L3 = length^#(n__cons(_0,n__from(_1))) -> length^#(from(activate(_1))) is in U_IR^3. Let p3 = [0]. We unfold the rule of L3 forwards at position p3 with the rule from(_0) -> cons(_0,n__from(n__s(_0))). ==> L4 = length^#(n__cons(_0,n__from(_1))) -> length^#(cons(activate(_1),n__from(n__s(activate(_1))))) is in U_IR^4. Let p4 = [0]. We unfold the rule of L4 forwards at position p4 with the rule cons(_0,_1) -> n__cons(_0,_1). ==> L5 = length^#(n__cons(_0,n__from(_1))) -> length^#(n__cons(activate(_1),n__from(n__s(activate(_1))))) is in U_IR^5. ** END proof description ** Proof stopped at iteration 5 Number of unfolded rules generated by this proof = 687 Number of unfolded rules generated by all the parallel proofs = 1283
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard