Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516962867
details
property
value
status
complete
benchmark
Ex1_Zan97_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
0.34336400032 seconds
cpu usage
0.562309606
max memory
5.8171392E7
stage attributes
key
value
output-size
3282
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO ** BEGIN proof argument ** The following rule was generated while unfolding the analyzed TRS: [iteration = 5] h(n__d) -> h(n__d) 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 = h(n__d) and theta2(theta1(l)) = theta1(r|p). Hence, the term theta1(l) = h(n__d) 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... ## 1 initial DP problem to solve. ## First, we try to decompose this problem into smaller problems. ## Round 1 [1 DP problem]: ## DP problem: Dependency pairs = [g^#(_0) -> h^#(activate(_0)), h^#(n__d) -> g^#(n__c)] TRS = {g(_0) -> h(activate(_0)), c -> d, h(n__d) -> g(n__c), d -> n__d, c -> n__c, activate(n__d) -> d, activate(n__c) -> c, activate(_0) -> _0} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Failed! ## Trying with lexicographic path orders... Failed! ## Trying with Knuth-Bendix orders... Failed! Don't know whether this DP problem is finite. ## A DP problem could not be proved finite. ## Now, we try to prove that this problem is infinite. ## Trying to find a loop (forward=true, backward=false, max=-1) # max_depth=2, unfold_variables=false: # Iteration 0: no loop found, 2 unfolded rules generated. # Iteration 1: no loop found, 3 unfolded rules generated. # Iteration 2: no loop found, 6 unfolded rules generated. # Iteration 3: no loop found, 1 unfolded rule generated. # Iteration 4: no loop found, 1 unfolded rule generated. # Iteration 5: success, found a loop, 1 unfolded rule generated. Here is the successful unfolding. Let IR be the TRS under analysis. L0 = h^#(n__d) -> g^#(n__c) [trans] is in U_IR^0. D = g^#(_0) -> h^#(activate(_0)) is a dependency pair of IR. We build a composed triple from L0 and D. ==> L1 = h^#(n__d) -> h^#(activate(n__c)) [trans] is in U_IR^1. We build a unit triple from L1. ==> L2 = h^#(n__d) -> h^#(activate(n__c)) [unit] is in U_IR^2. Let p2 = [0]. We unfold the rule of L2 forwards at position p2 with the rule activate(n__c) -> c. ==> L3 = h^#(n__d) -> h^#(c) [unit] is in U_IR^3. Let p3 = [0]. We unfold the rule of L3 forwards at position p3 with the rule c -> d. ==> L4 = h^#(n__d) -> h^#(d) [unit] is in U_IR^4. Let p4 = [0]. We unfold the rule of L4 forwards at position p4 with the rule d -> n__d. ==> L5 = h^#(n__d) -> h^#(n__d) [unit] is in U_IR^5. This DP problem is infinite. Proof run on Linux version 3.10.0-1160.25.1.el7.x86_64 for amd64 using Java version 1.8.0_292 ** END proof description ** Total number of generated unfolded rules = 58
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard