Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710935
details
property
value
status
complete
benchmark
pair2simple1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n100.star.cs.uiowa.edu
space
Endrullis_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
1.48484182358 seconds
cpu usage
1.458413891
max memory
5.0716672E7
stage attributes
key
value
output-size
2539
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x0 x1 x2) (RULES p(a(x0),p(a(b(x1)),x2)) -> p(a(b(a(x2))),p(a(a(x1)),x2)) ) Problem 1: Dependency Pairs Processor: -> Pairs: P(a(x0),p(a(b(x1)),x2)) -> P(a(a(x1)),x2) P(a(x0),p(a(b(x1)),x2)) -> P(a(b(a(x2))),p(a(a(x1)),x2)) -> Rules: p(a(x0),p(a(b(x1)),x2)) -> p(a(b(a(x2))),p(a(a(x1)),x2)) Problem 1: SCC Processor: -> Pairs: P(a(x0),p(a(b(x1)),x2)) -> P(a(a(x1)),x2) P(a(x0),p(a(b(x1)),x2)) -> P(a(b(a(x2))),p(a(a(x1)),x2)) -> Rules: p(a(x0),p(a(b(x1)),x2)) -> p(a(b(a(x2))),p(a(a(x1)),x2)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(a(x0),p(a(b(x1)),x2)) -> P(a(a(x1)),x2) P(a(x0),p(a(b(x1)),x2)) -> P(a(b(a(x2))),p(a(a(x1)),x2)) ->->-> Rules: p(a(x0),p(a(b(x1)),x2)) -> p(a(b(a(x2))),p(a(a(x1)),x2)) Problem 1: Reduction Pair Processor: -> Pairs: P(a(x0),p(a(b(x1)),x2)) -> P(a(a(x1)),x2) P(a(x0),p(a(b(x1)),x2)) -> P(a(b(a(x2))),p(a(a(x1)),x2)) -> Rules: p(a(x0),p(a(b(x1)),x2)) -> p(a(b(a(x2))),p(a(a(x1)),x2)) -> Usable rules: p(a(x0),p(a(b(x1)),x2)) -> p(a(b(a(x2))),p(a(a(x1)),x2)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [p](X1,X2) = 2.X1 + 2.X2 + 1 [a](X) = 2 [b](X) = 2 [P](X1,X2) = X1 + 2.X2 Problem 1: SCC Processor: -> Pairs: P(a(x0),p(a(b(x1)),x2)) -> P(a(b(a(x2))),p(a(a(x1)),x2)) -> Rules: p(a(x0),p(a(b(x1)),x2)) -> p(a(b(a(x2))),p(a(a(x1)),x2)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(a(x0),p(a(b(x1)),x2)) -> P(a(b(a(x2))),p(a(a(x1)),x2)) ->->-> Rules: p(a(x0),p(a(b(x1)),x2)) -> p(a(b(a(x2))),p(a(a(x1)),x2)) Problem 1: Reduction Pair Processor: -> Pairs: P(a(x0),p(a(b(x1)),x2)) -> P(a(b(a(x2))),p(a(a(x1)),x2)) -> Rules: p(a(x0),p(a(b(x1)),x2)) -> p(a(b(a(x2))),p(a(a(x1)),x2)) -> Usable rules: p(a(x0),p(a(b(x1)),x2)) -> p(a(b(a(x2))),p(a(a(x1)),x2)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 2 ->Bound: 1 ->Interpretation: [p](X1,X2) = [0 1;0 0].X1 + [1 1;1 0].X2 [a](X) = [0 0;1 0].X
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472