Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714157
details
property
value
status
complete
benchmark
enger-nonloop-unbounded.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n016.star.cs.uiowa.edu
space
EEG_IJCAR_12
run statistics
property
value
solver
Wanda
configuration
FirstOrder
runtime (wallclock)
0.638020992279 seconds
cpu usage
0.216686021
max memory
7196672.0
stage attributes
key
value
output-size
1414
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE We consider the system theBenchmark. We are asked to determine termination of the following first-order TRS. 0 : [] --> o false : [] --> o gt : [o * o] --> o h : [o * o * o] --> o s : [o] --> o true : [] --> o h(true, X, Y) => h(gt(X, Y), s(X), s(Y)) gt(0, X) => false gt(s(X), 0) => true gt(s(X), s(Y)) => gt(X, Y) As the system is orthogonal, it is terminating if it is innermost terminating by [Gra95]. Then, by [FuhGieParSchSwi11], it suffices to prove (innermost) termination of the typed system, with sort annotations chosen to respect the rules, as follows: 0 : [] --> na false : [] --> ra gt : [na * na] --> ra h : [ra * na * na] --> v s : [na] --> na true : [] --> ra +++ Citations +++ [FuhGieParSchSwi11] C. Fuhs, J. Giesl, M. Parting, P. Schneider-Kamp, and S. Swiderski. Proving Termination by Dependency Pairs and Inductive Theorem Proving. In volume 47(2) of Journal of Automated Reasoning. 133--160, 2011. [Gra95] B. Gramlich. Abstract Relations Between Restricted Termination and Confluence Properties of Rewrite Systems. In volume 24(1-2) of Fundamentae Informaticae. 3--23, 1995.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472