Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714014
details
property
value
status
complete
benchmark
4.52.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n088.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0177910327911 seconds
cpu usage
0.015397503
max memory
1732608.0
stage attributes
key
value
output-size
3133
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 u v x y) (RULES f(g(x,y),g(u,v)) -> g(f(x,u),f(y,v)) f(a,y) -> y f(x,a) -> x g(a,a) -> a s(f(x,y)) -> f(s(y),s(x)) s(g(x,y)) -> g(s(x),s(y)) s(s(x)) -> x s(a) -> a ) Problem 1: Dependency Pairs Processor: -> Pairs: F(g(x,y),g(u,v)) -> F(x,u) F(g(x,y),g(u,v)) -> F(y,v) F(g(x,y),g(u,v)) -> G(f(x,u),f(y,v)) S(f(x,y)) -> F(s(y),s(x)) S(f(x,y)) -> S(x) S(f(x,y)) -> S(y) S(g(x,y)) -> G(s(x),s(y)) S(g(x,y)) -> S(x) S(g(x,y)) -> S(y) -> Rules: f(g(x,y),g(u,v)) -> g(f(x,u),f(y,v)) f(a,y) -> y f(x,a) -> x g(a,a) -> a s(f(x,y)) -> f(s(y),s(x)) s(g(x,y)) -> g(s(x),s(y)) s(s(x)) -> x s(a) -> a Problem 1: SCC Processor: -> Pairs: F(g(x,y),g(u,v)) -> F(x,u) F(g(x,y),g(u,v)) -> F(y,v) F(g(x,y),g(u,v)) -> G(f(x,u),f(y,v)) S(f(x,y)) -> F(s(y),s(x)) S(f(x,y)) -> S(x) S(f(x,y)) -> S(y) S(g(x,y)) -> G(s(x),s(y)) S(g(x,y)) -> S(x) S(g(x,y)) -> S(y) -> Rules: f(g(x,y),g(u,v)) -> g(f(x,u),f(y,v)) f(a,y) -> y f(x,a) -> x g(a,a) -> a s(f(x,y)) -> f(s(y),s(x)) s(g(x,y)) -> g(s(x),s(y)) s(s(x)) -> x s(a) -> a ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(g(x,y),g(u,v)) -> F(x,u) F(g(x,y),g(u,v)) -> F(y,v) ->->-> Rules: f(g(x,y),g(u,v)) -> g(f(x,u),f(y,v)) f(a,y) -> y f(x,a) -> x g(a,a) -> a s(f(x,y)) -> f(s(y),s(x)) s(g(x,y)) -> g(s(x),s(y)) s(s(x)) -> x s(a) -> a ->->Cycle: ->->-> Pairs: S(f(x,y)) -> S(x) S(f(x,y)) -> S(y) S(g(x,y)) -> S(x) S(g(x,y)) -> S(y) ->->-> Rules: f(g(x,y),g(u,v)) -> g(f(x,u),f(y,v)) f(a,y) -> y f(x,a) -> x g(a,a) -> a s(f(x,y)) -> f(s(y),s(x)) s(g(x,y)) -> g(s(x),s(y)) s(s(x)) -> x s(a) -> a The problem is decomposed in 2 subproblems.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472