Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964176
details
property
value
status
complete
benchmark
17.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n066.star.cs.uiowa.edu
space
Der95
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0611069202423 seconds
cpu usage
0.02028796
max memory
1896448.0
stage attributes
key
value
output-size
3737
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 v_NonEmpty:S x:S y:S z:S) (RULES .(.(x:S,y:S),z:S) -> .(x:S,.(y:S,z:S)) .(i(x:S),x:S) -> 1 .(i(y:S),.(y:S,z:S)) -> z:S .(1,x:S) -> x:S .(x:S,i(x:S)) -> 1 .(x:S,1) -> x:S .(y:S,.(i(y:S),z:S)) -> z:S i(.(x:S,y:S)) -> .(i(y:S),i(x:S)) i(i(x:S)) -> x:S i(1) -> 1 ) Problem 1: Dependency Pairs Processor: -> Pairs: .#(.(x:S,y:S),z:S) -> .#(x:S,.(y:S,z:S)) .#(.(x:S,y:S),z:S) -> .#(y:S,z:S) I(.(x:S,y:S)) -> .#(i(y:S),i(x:S)) I(.(x:S,y:S)) -> I(x:S) I(.(x:S,y:S)) -> I(y:S) -> Rules: .(.(x:S,y:S),z:S) -> .(x:S,.(y:S,z:S)) .(i(x:S),x:S) -> 1 .(i(y:S),.(y:S,z:S)) -> z:S .(1,x:S) -> x:S .(x:S,i(x:S)) -> 1 .(x:S,1) -> x:S .(y:S,.(i(y:S),z:S)) -> z:S i(.(x:S,y:S)) -> .(i(y:S),i(x:S)) i(i(x:S)) -> x:S i(1) -> 1 Problem 1: SCC Processor: -> Pairs: .#(.(x:S,y:S),z:S) -> .#(x:S,.(y:S,z:S)) .#(.(x:S,y:S),z:S) -> .#(y:S,z:S) I(.(x:S,y:S)) -> .#(i(y:S),i(x:S)) I(.(x:S,y:S)) -> I(x:S) I(.(x:S,y:S)) -> I(y:S) -> Rules: .(.(x:S,y:S),z:S) -> .(x:S,.(y:S,z:S)) .(i(x:S),x:S) -> 1 .(i(y:S),.(y:S,z:S)) -> z:S .(1,x:S) -> x:S .(x:S,i(x:S)) -> 1 .(x:S,1) -> x:S .(y:S,.(i(y:S),z:S)) -> z:S i(.(x:S,y:S)) -> .(i(y:S),i(x:S)) i(i(x:S)) -> x:S i(1) -> 1 ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: .#(.(x:S,y:S),z:S) -> .#(x:S,.(y:S,z:S)) .#(.(x:S,y:S),z:S) -> .#(y:S,z:S) ->->-> Rules: .(.(x:S,y:S),z:S) -> .(x:S,.(y:S,z:S)) .(i(x:S),x:S) -> 1 .(i(y:S),.(y:S,z:S)) -> z:S .(1,x:S) -> x:S .(x:S,i(x:S)) -> 1 .(x:S,1) -> x:S .(y:S,.(i(y:S),z:S)) -> z:S i(.(x:S,y:S)) -> .(i(y:S),i(x:S)) i(i(x:S)) -> x:S i(1) -> 1 ->->Cycle: ->->-> Pairs: I(.(x:S,y:S)) -> I(x:S) I(.(x:S,y:S)) -> I(y:S) ->->-> Rules: .(.(x:S,y:S),z:S) -> .(x:S,.(y:S,z:S)) .(i(x:S),x:S) -> 1 .(i(y:S),.(y:S,z:S)) -> z:S .(1,x:S) -> x:S .(x:S,i(x:S)) -> 1 .(x:S,1) -> x:S .(y:S,.(i(y:S),z:S)) -> z:S i(.(x:S,y:S)) -> .(i(y:S),i(x:S)) i(i(x:S)) -> x:S i(1) -> 1 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 Standard