Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710269
details
property
value
status
complete
benchmark
pair3rotate.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n002.star.cs.uiowa.edu
space
Endrullis_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.496002912521 seconds
cpu usage
0.079014775
max memory
4001792.0
stage attributes
key
value
output-size
2665
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 x0 x1 x2 x3) (RULES p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3))) ) Problem 1: Dependency Pairs Processor: -> Pairs: P(a(x0),p(b(x1),p(a(x2),x3))) -> P(a(a(x0)),p(b(x1),x3)) P(a(x0),p(b(x1),p(a(x2),x3))) -> P(x2,p(a(a(x0)),p(b(x1),x3))) -> Rules: p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3))) Problem 1: SCC Processor: -> Pairs: P(a(x0),p(b(x1),p(a(x2),x3))) -> P(a(a(x0)),p(b(x1),x3)) P(a(x0),p(b(x1),p(a(x2),x3))) -> P(x2,p(a(a(x0)),p(b(x1),x3))) -> Rules: p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(a(x0),p(b(x1),p(a(x2),x3))) -> P(a(a(x0)),p(b(x1),x3)) P(a(x0),p(b(x1),p(a(x2),x3))) -> P(x2,p(a(a(x0)),p(b(x1),x3))) ->->-> Rules: p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3))) Problem 1: Reduction Pair Processor: -> Pairs: P(a(x0),p(b(x1),p(a(x2),x3))) -> P(a(a(x0)),p(b(x1),x3)) P(a(x0),p(b(x1),p(a(x2),x3))) -> P(x2,p(a(a(x0)),p(b(x1),x3))) -> Rules: p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3))) -> Usable rules: p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [p](X1,X2) = 2.X1 + X2 + 2 [a](X) = X [b](X) = 2.X + 2 [P](X1,X2) = 2.X1 + X2 Problem 1: SCC Processor: -> Pairs: P(a(x0),p(b(x1),p(a(x2),x3))) -> P(x2,p(a(a(x0)),p(b(x1),x3))) -> Rules: p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(a(x0),p(b(x1),p(a(x2),x3))) -> P(x2,p(a(a(x0)),p(b(x1),x3))) ->->-> Rules: p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3))) Problem 1: Reduction Pair Processor: -> Pairs: P(a(x0),p(b(x1),p(a(x2),x3))) -> P(x2,p(a(a(x0)),p(b(x1),x3))) -> Rules: p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3))) -> Usable rules: p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3))) ->Interpretation type: Linear ->Coefficients: All rationals ->Dimension: 1 ->Bound: 2 ->Interpretation: [p](X1,X2) = 2.X1 + 2.X2 [a](X) = 1/2.X + 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472