Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711273
details
property
value
status
complete
benchmark
gen-9.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.330293178558 seconds
cpu usage
0.306180312
max memory
9158656.0
stage attributes
key
value
output-size
4037
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 x y z) (RULES b(z,b(c(a,y,a),f(f(x)))) -> c(c(y,a,z),z,x) c(c(z,y,a),a,a) -> b(z,y) f(c(x,y,z)) -> c(z,f(b(y,z)),a) ) Problem 1: Dependency Pairs Processor: -> Pairs: B(z,b(c(a,y,a),f(f(x)))) -> C(c(y,a,z),z,x) B(z,b(c(a,y,a),f(f(x)))) -> C(y,a,z) C(c(z,y,a),a,a) -> B(z,y) F(c(x,y,z)) -> B(y,z) F(c(x,y,z)) -> C(z,f(b(y,z)),a) F(c(x,y,z)) -> F(b(y,z)) -> Rules: b(z,b(c(a,y,a),f(f(x)))) -> c(c(y,a,z),z,x) c(c(z,y,a),a,a) -> b(z,y) f(c(x,y,z)) -> c(z,f(b(y,z)),a) Problem 1: SCC Processor: -> Pairs: B(z,b(c(a,y,a),f(f(x)))) -> C(c(y,a,z),z,x) B(z,b(c(a,y,a),f(f(x)))) -> C(y,a,z) C(c(z,y,a),a,a) -> B(z,y) F(c(x,y,z)) -> B(y,z) F(c(x,y,z)) -> C(z,f(b(y,z)),a) F(c(x,y,z)) -> F(b(y,z)) -> Rules: b(z,b(c(a,y,a),f(f(x)))) -> c(c(y,a,z),z,x) c(c(z,y,a),a,a) -> b(z,y) f(c(x,y,z)) -> c(z,f(b(y,z)),a) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B(z,b(c(a,y,a),f(f(x)))) -> C(c(y,a,z),z,x) B(z,b(c(a,y,a),f(f(x)))) -> C(y,a,z) C(c(z,y,a),a,a) -> B(z,y) ->->-> Rules: b(z,b(c(a,y,a),f(f(x)))) -> c(c(y,a,z),z,x) c(c(z,y,a),a,a) -> b(z,y) f(c(x,y,z)) -> c(z,f(b(y,z)),a) ->->Cycle: ->->-> Pairs: F(c(x,y,z)) -> F(b(y,z)) ->->-> Rules: b(z,b(c(a,y,a),f(f(x)))) -> c(c(y,a,z),z,x) c(c(z,y,a),a,a) -> b(z,y) f(c(x,y,z)) -> c(z,f(b(y,z)),a) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pair Processor: -> Pairs: B(z,b(c(a,y,a),f(f(x)))) -> C(c(y,a,z),z,x) B(z,b(c(a,y,a),f(f(x)))) -> C(y,a,z) C(c(z,y,a),a,a) -> B(z,y) -> Rules: b(z,b(c(a,y,a),f(f(x)))) -> c(c(y,a,z),z,x) c(c(z,y,a),a,a) -> b(z,y) f(c(x,y,z)) -> c(z,f(b(y,z)),a) -> Usable rules: b(z,b(c(a,y,a),f(f(x)))) -> c(c(y,a,z),z,x) c(c(z,y,a),a,a) -> b(z,y) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [b](X1,X2) = 2.X1 + 2.X2 + 2 [c](X1,X2,X3) = 2.X1 + 2.X2 + 2 [f](X) = 2.X [a] = 1 [B](X1,X2) = 2.X1 + 2.X2 + 2 [C](X1,X2,X3) = 2.X1 + X2 + 2.X3 + 2 Problem 1.1:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472