Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715611
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nosorts_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
1.2521750927 seconds
cpu usage
1.021817798
max memory
4497408.0
stage attributes
key
value
output-size
3572
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR L N X) (RULES activate(n__zeros) -> zeros activate(X) -> X and(tt,X) -> activate(X) length(cons(N,L)) -> s(length(activate(L))) length(nil) -> 0 zeros -> cons(0,n__zeros) zeros -> n__zeros ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__zeros) -> ZEROS AND(tt,X) -> ACTIVATE(X) LENGTH(cons(N,L)) -> ACTIVATE(L) LENGTH(cons(N,L)) -> LENGTH(activate(L)) -> Rules: activate(n__zeros) -> zeros activate(X) -> X and(tt,X) -> activate(X) length(cons(N,L)) -> s(length(activate(L))) length(nil) -> 0 zeros -> cons(0,n__zeros) zeros -> n__zeros Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__zeros) -> ZEROS AND(tt,X) -> ACTIVATE(X) LENGTH(cons(N,L)) -> ACTIVATE(L) LENGTH(cons(N,L)) -> LENGTH(activate(L)) -> Rules: activate(n__zeros) -> zeros activate(X) -> X and(tt,X) -> activate(X) length(cons(N,L)) -> s(length(activate(L))) length(nil) -> 0 zeros -> cons(0,n__zeros) zeros -> n__zeros ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LENGTH(cons(N,L)) -> LENGTH(activate(L)) ->->-> Rules: activate(n__zeros) -> zeros activate(X) -> X and(tt,X) -> activate(X) length(cons(N,L)) -> s(length(activate(L))) length(nil) -> 0 zeros -> cons(0,n__zeros) zeros -> n__zeros Problem 1: Narrowing Processor: -> Pairs: LENGTH(cons(N,L)) -> LENGTH(activate(L)) -> Rules: activate(n__zeros) -> zeros activate(X) -> X and(tt,X) -> activate(X) length(cons(N,L)) -> s(length(activate(L))) length(nil) -> 0 zeros -> cons(0,n__zeros) zeros -> n__zeros ->Narrowed Pairs: ->->Original Pair: LENGTH(cons(N,L)) -> LENGTH(activate(L)) ->-> Narrowed pairs: LENGTH(cons(x4,n__zeros)) -> LENGTH(zeros) LENGTH(cons(x4,X)) -> LENGTH(X) Problem 1: SCC Processor: -> Pairs: LENGTH(cons(x4,n__zeros)) -> LENGTH(zeros) LENGTH(cons(x4,X)) -> LENGTH(X) -> Rules: activate(n__zeros) -> zeros activate(X) -> X and(tt,X) -> activate(X) length(cons(N,L)) -> s(length(activate(L))) length(nil) -> 0 zeros -> cons(0,n__zeros)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472