Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516965047
details
property
value
status
complete
benchmark
023.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
AotoYamada_05
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
0.225520133972 seconds
cpu usage
0.18514787
max memory
3.1158272E7
stage attributes
key
value
output-size
1361
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ** BEGIN proof argument ** All the DP problems were proved finite. As all the involved DP processors are sound, the TRS under analysis terminates. ** 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 = [app^#(app(plus,app(s,_0)),_1) -> app^#(app(plus,_0),_1)] TRS = {app(id,_0) -> _0, app(plus,0) -> id, app(app(plus,app(s,_0)),_1) -> app(s,app(app(plus,_0),_1))} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## All the DP problems were proved finite. As all the involved DP processors are sound, the TRS under analysis terminates. 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 = 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard