Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964367
details
property
value
status
complete
benchmark
ex11.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
Zantema_15
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
0.370429039001 seconds
cpu usage
0.447702032
max memory
5.3571584E7
stage attributes
key
value
output-size
1968
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 double path program (DPP) was generated while unfolding the analyzed TRS: [iteration = 1] [f^#(_0,s(_1)) -> f^#(s(_0),_1), f^#(_2,0) -> f^#(s(0),_2)] [comp] This DPP admits the recurrent pair: < C1 = f^#(s(□),0), C2 = f^#(◯,s(□)), Δ = s(□), u = 0 > Hence, the term f(s(0),0) is nonterminating 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 = [f^#(_0,s(_1)) -> f^#(s(_0),_1), f^#(_0,0) -> f^#(s(0),_0)] TRS = {f(_0,s(_1)) -> f(s(_0),_1), f(_0,0) -> f(s(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: success, found a loop, 1 unfolded rule generated. 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 = 7
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard