Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964456
details
property
value
status
complete
benchmark
muladd.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Strategy_removed_mixed_05
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
20.3615968227 seconds
cpu usage
20.256791074
max memory
6746112.0
stage attributes
key
value
output-size
1748
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR v_NonEmpty:S X:S Y:S) (RULES *(X:S,+(Y:S,1)) -> +(*(X:S,+(Y:S,*(1,0))),X:S) *(X:S,0) -> 0 *(X:S,0) -> X:S *(X:S,1) -> X:S ) Problem 1: Dependency Pairs Processor: -> Pairs: *#(X:S,+(Y:S,1)) -> *#(1,0) *#(X:S,+(Y:S,1)) -> *#(X:S,+(Y:S,*(1,0))) -> Rules: *(X:S,+(Y:S,1)) -> +(*(X:S,+(Y:S,*(1,0))),X:S) *(X:S,0) -> 0 *(X:S,0) -> X:S *(X:S,1) -> X:S Problem 1: SCC Processor: -> Pairs: *#(X:S,+(Y:S,1)) -> *#(1,0) *#(X:S,+(Y:S,1)) -> *#(X:S,+(Y:S,*(1,0))) -> Rules: *(X:S,+(Y:S,1)) -> +(*(X:S,+(Y:S,*(1,0))),X:S) *(X:S,0) -> 0 *(X:S,0) -> X:S *(X:S,1) -> X:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: *#(X:S,+(Y:S,1)) -> *#(X:S,+(Y:S,*(1,0))) ->->-> Rules: *(X:S,+(Y:S,1)) -> +(*(X:S,+(Y:S,*(1,0))),X:S) *(X:S,0) -> 0 *(X:S,0) -> X:S *(X:S,1) -> X:S Problem 1: Narrowing Processor: -> Pairs: *#(X:S,+(Y:S,1)) -> *#(X:S,+(Y:S,*(1,0))) -> Rules: *(X:S,+(Y:S,1)) -> +(*(X:S,+(Y:S,*(1,0))),X:S) *(X:S,0) -> 0 *(X:S,0) -> X:S *(X:S,1) -> X:S ->Narrowed Pairs: ->->Original Pair: *#(X:S,+(Y:S,1)) -> *#(X:S,+(Y:S,*(1,0))) ->-> Narrowed pairs: *#(x3:S,+(x4:S,1)) -> *#(x3:S,+(x4:S,0)) *#(x3:S,+(x4:S,1)) -> *#(x3:S,+(x4:S,1)) Problem 1: Infinite Processor: -> Pairs: *#(x3:S,+(x4:S,1)) -> *#(x3:S,+(x4:S,0)) *#(x3:S,+(x4:S,1)) -> *#(x3:S,+(x4:S,1)) -> Rules: *(X:S,+(Y:S,1)) -> +(*(X:S,+(Y:S,*(1,0))),X:S) *(X:S,0) -> 0 *(X:S,0) -> X:S *(X:S,1) -> X:S -> Pairs in cycle: *#(x3:S,+(x4:S,1)) -> *#(x3:S,+(x4:S,1)) The problem is infinite.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard