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