Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516961987
details
property
value
status
complete
benchmark
Ex1_Zan97_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n005.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
0.532498836517 seconds
cpu usage
1.120136752
max memory
1.13647616E8
stage attributes
key
value
output-size
3524
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... ## 4 initial DP problems to solve. ## First, we try to decompose these problems into smaller problems. ## Round 1 [4 DP problems]: ## DP problem: Dependency pairs = [top^#(mark(_0)) -> top^#(proper(_0)), top^#(ok(_0)) -> top^#(active(_0))] TRS = {active(g(_0)) -> mark(h(_0)), active(c) -> mark(d), active(h(d)) -> mark(g(c)), proper(g(_0)) -> g(proper(_0)), proper(h(_0)) -> h(proper(_0)), proper(c) -> ok(c), proper(d) -> ok(d), g(ok(_0)) -> ok(g(_0)), h(ok(_0)) -> ok(h(_0)), top(mark(_0)) -> top(proper(_0)), top(ok(_0)) -> top(active(_0))} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... This DP problem is too complex! Aborting! ## 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 = [proper^#(g(_0)) -> proper^#(_0), proper^#(h(_0)) -> proper^#(_0)] TRS = {active(g(_0)) -> mark(h(_0)), active(c) -> mark(d), active(h(d)) -> mark(g(c)), proper(g(_0)) -> g(proper(_0)), proper(h(_0)) -> h(proper(_0)), proper(c) -> ok(c), proper(d) -> ok(d), g(ok(_0)) -> ok(g(_0)), h(ok(_0)) -> ok(h(_0)), top(mark(_0)) -> top(proper(_0)), top(ok(_0)) -> top(active(_0))} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [g^#(ok(_0)) -> g^#(_0)] TRS = {active(g(_0)) -> mark(h(_0)), active(c) -> mark(d), active(h(d)) -> mark(g(c)), proper(g(_0)) -> g(proper(_0)), proper(h(_0)) -> h(proper(_0)), proper(c) -> ok(c), proper(d) -> ok(d), g(ok(_0)) -> ok(g(_0)), h(ok(_0)) -> ok(h(_0)), top(mark(_0)) -> top(proper(_0)), top(ok(_0)) -> top(active(_0))} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [h^#(ok(_0)) -> h^#(_0)] TRS = {active(g(_0)) -> mark(h(_0)), active(c) -> mark(d), active(h(d)) -> mark(g(c)), proper(g(_0)) -> g(proper(_0)), proper(h(_0)) -> h(proper(_0)), proper(c) -> ok(c), proper(d) -> ok(d), g(ok(_0)) -> ok(g(_0)), h(ok(_0)) -> ok(h(_0)), top(mark(_0)) -> top(proper(_0)), top(ok(_0)) -> top(active(_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 = [top^#(mark(_0)) -> top^#(proper(_0)), top^#(ok(_0)) -> top^#(active(_0))] TRS = {active(g(_0)) -> mark(h(_0)), active(c) -> mark(d), active(h(d)) -> mark(g(c)), proper(g(_0)) -> g(proper(_0)), proper(h(_0)) -> h(proper(_0)), proper(c) -> ok(c), proper(d) -> ok(d), g(ok(_0)) -> ok(g(_0)), h(ok(_0)) -> ok(h(_0)), top(mark(_0)) -> top(proper(_0)), top(ok(_0)) -> top(active(_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 = 554
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard