Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Equational pair #487092750
details
property
value
status
complete
benchmark
AC28.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n147.star.cs.uiowa.edu
space
AProVE_AC_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
30.4886 seconds
cpu usage
30.4753
user time
29.768
system time
0.707358
max virtual memory
1284312.0
max residence set size
493604.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR X Y Z x y) (THEORY (AC union)) (RULES max(union(singl(s(x)),singl(s(y)))) -> s(max(union(singl(x),singl(y)))) max(union(singl(x),union(Y,Z))) -> max(union(singl(x),singl(max(union(Y,Z))))) max(union(singl(x),singl(0))) -> x max(singl(x)) -> x union(empty,X) -> X ) Problem 1: Reduction Order Processor: -> Rules: max(union(singl(s(x)),singl(s(y)))) -> s(max(union(singl(x),singl(y)))) max(union(singl(x),union(Y,Z))) -> max(union(singl(x),singl(max(union(Y,Z))))) max(union(singl(x),singl(0))) -> x max(singl(x)) -> x union(empty,X) -> X ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [max](X) = X [union](X1,X2) = X1 + X2 + 1 [0] = 0 [empty] = 0 [s](X) = X + 1 [singl](X) = X Problem 1: Reduction Order Processor: -> Rules: max(union(singl(x),union(Y,Z))) -> max(union(singl(x),singl(max(union(Y,Z))))) max(union(singl(x),singl(0))) -> x max(singl(x)) -> x union(empty,X) -> X ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [max](X) = X [union](X1,X2) = X1 + X2 [0] = 2 [empty] = 0 [s](X) = 2.X [singl](X) = X Problem 1: Reduction Order Processor: -> Rules: max(union(singl(x),union(Y,Z))) -> max(union(singl(x),singl(max(union(Y,Z))))) max(singl(x)) -> x union(empty,X) -> X ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [max](X) = X [union](X1,X2) = X1 + X2 + 1 [0] = 0 [empty] = 2 [s](X) = 2.X [singl](X) = X Problem 1: Dependency Pairs Processor: -> FAxioms: UNION(union(x5,x6),x7) = UNION(x5,union(x6,x7)) UNION(x5,x6) = UNION(x6,x5) -> Pairs: MAX(union(singl(x),union(Y,Z))) -> MAX(union(singl(x),singl(max(union(Y,Z))))) MAX(union(singl(x),union(Y,Z))) -> MAX(union(Y,Z)) MAX(union(singl(x),union(Y,Z))) -> UNION(singl(x),singl(max(union(Y,Z))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Equational