Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516966352
details
property
value
status
complete
benchmark
round_nonterm.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
AProVE_08
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
0.338398933411 seconds
cpu usage
0.574279428
max memory
5.476352E7
stage attributes
key
value
output-size
2848
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 = 2] f(s(0),0) -> f(s(0),0) 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(s(0),0) and theta2(theta1(l)) = theta1(r|p). Hence, the term theta1(l) = f(s(0),0) 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... ## 2 initial DP problems to solve. ## First, we try to decompose these problems into smaller problems. ## Round 1 [2 DP problems]: ## DP problem: Dependency pairs = [f^#(s(_0),_0) -> f^#(s(_0),round(_0))] TRS = {f(s(_0),_0) -> f(s(_0),round(_0)), round(0) -> 0, round(0) -> s(0), round(s(0)) -> s(0), round(s(s(_0))) -> s(s(round(_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. ## DP problem: Dependency pairs = [round^#(s(s(_0))) -> round^#(_0)] TRS = {f(s(_0),_0) -> f(s(_0),round(_0)), round(0) -> 0, round(0) -> s(0), round(s(0)) -> s(0), round(s(s(_0))) -> s(s(round(_0)))} ## Trying with homeomorphic embeddings... Success! 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=true, max=20) # max_depth=20, unfold_variables=false: # Iteration 0: no loop found, 1 unfolded rule generated. # Iteration 1: no loop found, 1 unfolded rule generated. # Iteration 2: success, found a loop, 1 unfolded rule generated. Here is the successful unfolding. Let IR be the TRS under analysis. L0 = f^#(s(_0),_0) -> f^#(s(_0),round(_0)) [trans] is in U_IR^0. We build a unit triple from L0. ==> L1 = f^#(s(_0),_0) -> f^#(s(_0),round(_0)) [unit] is in U_IR^1. Let p1 = [1]. We unfold the rule of L1 forwards at position p1 with the rule round(0) -> 0. ==> L2 = f^#(s(0),0) -> f^#(s(0),0) [unit] is in U_IR^2. 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 = 8
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard