Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516966367
details
property
value
status
complete
benchmark
round.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
AProVE_08
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
0.690835952759 seconds
cpu usage
1.607389337
max memory
1.48185088E8
stage attributes
key
value
output-size
1976
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE ** 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(s(_0)))] TRS = {f(s(_0),_0) -> f(s(_0),round(s(_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(s(_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. ## Could not solve the following DP problems: 1: Dependency pairs = [f^#(s(_0),_0) -> f^#(s(_0),round(s(_0)))] TRS = {f(s(_0),_0) -> f(s(_0),round(s(_0))), round(0) -> 0, round(0) -> s(0), round(s(0)) -> s(0), round(s(s(_0))) -> s(s(round(_0)))} Hence, could not prove (non)termination of the TRS under analysis. 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 = 243
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard