Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381709951
details
property
value
status
complete
benchmark
polycounter-10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n083.star.cs.uiowa.edu
space
TCT_12
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.059061050415 seconds
cpu usage
0.055676924
max memory
4526080.0
stage attributes
key
value
output-size
40582
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 Problem 1: (VAR x1 x10 x2 x3 x4 x5 x6 x7 x8 x9) (RULES f(0,0,0,0,0,0,0,0,0,0) -> 0 f(0,0,0,0,0,0,0,0,0,s(x10)) -> f(x10,x10,x10,x10,x10,x10,x10,x10,x10,x10) f(0,0,0,0,0,0,0,0,s(x9),x10) -> f(x9,x9,x9,x9,x9,x9,x9,x9,x9,x10) f(0,0,0,0,0,0,0,s(x8),x9,x10) -> f(x8,x8,x8,x8,x8,x8,x8,x8,x9,x10) f(0,0,0,0,0,0,s(x7),x8,x9,x10) -> f(x7,x7,x7,x7,x7,x7,x7,x8,x9,x10) f(0,0,0,0,0,s(x6),x7,x8,x9,x10) -> f(x6,x6,x6,x6,x6,x6,x7,x8,x9,x10) f(0,0,0,0,s(x5),x6,x7,x8,x9,x10) -> f(x5,x5,x5,x5,x5,x6,x7,x8,x9,x10) f(0,0,0,s(x4),x5,x6,x7,x8,x9,x10) -> f(x4,x4,x4,x4,x5,x6,x7,x8,x9,x10) f(0,0,s(x3),x4,x5,x6,x7,x8,x9,x10) -> f(x3,x3,x3,x4,x5,x6,x7,x8,x9,x10) f(0,s(x2),x3,x4,x5,x6,x7,x8,x9,x10) -> f(x2,x2,x3,x4,x5,x6,x7,x8,x9,x10) f(s(x1),x2,x3,x4,x5,x6,x7,x8,x9,x10) -> f(x1,x2,x3,x4,x5,x6,x7,x8,x9,x10) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(0,0,0,0,0,0,0,0,0,0) -> 0 f(0,0,0,0,0,0,0,0,0,s(x10)) -> f(x10,x10,x10,x10,x10,x10,x10,x10,x10,x10) f(0,0,0,0,0,0,0,0,s(x9),x10) -> f(x9,x9,x9,x9,x9,x9,x9,x9,x9,x10) f(0,0,0,0,0,0,0,s(x8),x9,x10) -> f(x8,x8,x8,x8,x8,x8,x8,x8,x9,x10) f(0,0,0,0,0,0,s(x7),x8,x9,x10) -> f(x7,x7,x7,x7,x7,x7,x7,x8,x9,x10) f(0,0,0,0,0,s(x6),x7,x8,x9,x10) -> f(x6,x6,x6,x6,x6,x6,x7,x8,x9,x10) f(0,0,0,0,s(x5),x6,x7,x8,x9,x10) -> f(x5,x5,x5,x5,x5,x6,x7,x8,x9,x10) f(0,0,0,s(x4),x5,x6,x7,x8,x9,x10) -> f(x4,x4,x4,x4,x5,x6,x7,x8,x9,x10) f(0,0,s(x3),x4,x5,x6,x7,x8,x9,x10) -> f(x3,x3,x3,x4,x5,x6,x7,x8,x9,x10) f(0,s(x2),x3,x4,x5,x6,x7,x8,x9,x10) -> f(x2,x2,x3,x4,x5,x6,x7,x8,x9,x10) f(s(x1),x2,x3,x4,x5,x6,x7,x8,x9,x10) -> f(x1,x2,x3,x4,x5,x6,x7,x8,x9,x10) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(0,0,0,0,0,0,0,0,0,s(x10)) -> F(x10,x10,x10,x10,x10,x10,x10,x10,x10,x10) F(0,0,0,0,0,0,0,0,s(x9),x10) -> F(x9,x9,x9,x9,x9,x9,x9,x9,x9,x10) F(0,0,0,0,0,0,0,s(x8),x9,x10) -> F(x8,x8,x8,x8,x8,x8,x8,x8,x9,x10) F(0,0,0,0,0,0,s(x7),x8,x9,x10) -> F(x7,x7,x7,x7,x7,x7,x7,x8,x9,x10) F(0,0,0,0,0,s(x6),x7,x8,x9,x10) -> F(x6,x6,x6,x6,x6,x6,x7,x8,x9,x10) F(0,0,0,0,s(x5),x6,x7,x8,x9,x10) -> F(x5,x5,x5,x5,x5,x6,x7,x8,x9,x10) F(0,0,0,s(x4),x5,x6,x7,x8,x9,x10) -> F(x4,x4,x4,x4,x5,x6,x7,x8,x9,x10) F(0,0,s(x3),x4,x5,x6,x7,x8,x9,x10) -> F(x3,x3,x3,x4,x5,x6,x7,x8,x9,x10) F(0,s(x2),x3,x4,x5,x6,x7,x8,x9,x10) -> F(x2,x2,x3,x4,x5,x6,x7,x8,x9,x10) F(s(x1),x2,x3,x4,x5,x6,x7,x8,x9,x10) -> F(x1,x2,x3,x4,x5,x6,x7,x8,x9,x10) -> Rules: f(0,0,0,0,0,0,0,0,0,0) -> 0 f(0,0,0,0,0,0,0,0,0,s(x10)) -> f(x10,x10,x10,x10,x10,x10,x10,x10,x10,x10) f(0,0,0,0,0,0,0,0,s(x9),x10) -> f(x9,x9,x9,x9,x9,x9,x9,x9,x9,x10) f(0,0,0,0,0,0,0,s(x8),x9,x10) -> f(x8,x8,x8,x8,x8,x8,x8,x8,x9,x10) f(0,0,0,0,0,0,s(x7),x8,x9,x10) -> f(x7,x7,x7,x7,x7,x7,x7,x8,x9,x10) f(0,0,0,0,0,s(x6),x7,x8,x9,x10) -> f(x6,x6,x6,x6,x6,x6,x7,x8,x9,x10) f(0,0,0,0,s(x5),x6,x7,x8,x9,x10) -> f(x5,x5,x5,x5,x5,x6,x7,x8,x9,x10) f(0,0,0,s(x4),x5,x6,x7,x8,x9,x10) -> f(x4,x4,x4,x4,x5,x6,x7,x8,x9,x10) f(0,0,s(x3),x4,x5,x6,x7,x8,x9,x10) -> f(x3,x3,x3,x4,x5,x6,x7,x8,x9,x10) f(0,s(x2),x3,x4,x5,x6,x7,x8,x9,x10) -> f(x2,x2,x3,x4,x5,x6,x7,x8,x9,x10) f(s(x1),x2,x3,x4,x5,x6,x7,x8,x9,x10) -> f(x1,x2,x3,x4,x5,x6,x7,x8,x9,x10) Problem 1: SCC Processor: -> Pairs: F(0,0,0,0,0,0,0,0,0,s(x10)) -> F(x10,x10,x10,x10,x10,x10,x10,x10,x10,x10) F(0,0,0,0,0,0,0,0,s(x9),x10) -> F(x9,x9,x9,x9,x9,x9,x9,x9,x9,x10) F(0,0,0,0,0,0,0,s(x8),x9,x10) -> F(x8,x8,x8,x8,x8,x8,x8,x8,x9,x10) F(0,0,0,0,0,0,s(x7),x8,x9,x10) -> F(x7,x7,x7,x7,x7,x7,x7,x8,x9,x10) F(0,0,0,0,0,s(x6),x7,x8,x9,x10) -> F(x6,x6,x6,x6,x6,x6,x7,x8,x9,x10) F(0,0,0,0,s(x5),x6,x7,x8,x9,x10) -> F(x5,x5,x5,x5,x5,x6,x7,x8,x9,x10) F(0,0,0,s(x4),x5,x6,x7,x8,x9,x10) -> F(x4,x4,x4,x4,x5,x6,x7,x8,x9,x10) F(0,0,s(x3),x4,x5,x6,x7,x8,x9,x10) -> F(x3,x3,x3,x4,x5,x6,x7,x8,x9,x10) F(0,s(x2),x3,x4,x5,x6,x7,x8,x9,x10) -> F(x2,x2,x3,x4,x5,x6,x7,x8,x9,x10) F(s(x1),x2,x3,x4,x5,x6,x7,x8,x9,x10) -> F(x1,x2,x3,x4,x5,x6,x7,x8,x9,x10) -> Rules: f(0,0,0,0,0,0,0,0,0,0) -> 0 f(0,0,0,0,0,0,0,0,0,s(x10)) -> f(x10,x10,x10,x10,x10,x10,x10,x10,x10,x10) f(0,0,0,0,0,0,0,0,s(x9),x10) -> f(x9,x9,x9,x9,x9,x9,x9,x9,x9,x10) f(0,0,0,0,0,0,0,s(x8),x9,x10) -> f(x8,x8,x8,x8,x8,x8,x8,x8,x9,x10) f(0,0,0,0,0,0,s(x7),x8,x9,x10) -> f(x7,x7,x7,x7,x7,x7,x7,x8,x9,x10) f(0,0,0,0,0,s(x6),x7,x8,x9,x10) -> f(x6,x6,x6,x6,x6,x6,x7,x8,x9,x10) f(0,0,0,0,s(x5),x6,x7,x8,x9,x10) -> f(x5,x5,x5,x5,x5,x6,x7,x8,x9,x10) f(0,0,0,s(x4),x5,x6,x7,x8,x9,x10) -> f(x4,x4,x4,x4,x5,x6,x7,x8,x9,x10) f(0,0,s(x3),x4,x5,x6,x7,x8,x9,x10) -> f(x3,x3,x3,x4,x5,x6,x7,x8,x9,x10) f(0,s(x2),x3,x4,x5,x6,x7,x8,x9,x10) -> f(x2,x2,x3,x4,x5,x6,x7,x8,x9,x10) f(s(x1),x2,x3,x4,x5,x6,x7,x8,x9,x10) -> f(x1,x2,x3,x4,x5,x6,x7,x8,x9,x10) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(0,0,0,0,0,0,0,0,0,s(x10)) -> F(x10,x10,x10,x10,x10,x10,x10,x10,x10,x10)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472