Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997181
details
property
value
status
complete
benchmark
AC15.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n071.star.cs.uiowa.edu
space
AProVE_AC_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.074385 seconds
cpu usage
0.049029
user time
0.017972
system time
0.031057
max virtual memory
113176.0
max residence set size
4088.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.07 YES 0.00/0.07 0.00/0.07 Problem 1: 0.00/0.07 0.00/0.07 (VAR x) 0.00/0.07 (THEORY 0.00/0.07 (AC f)) 0.00/0.07 (RULES 0.00/0.07 f(f(x,x),g(x)) -> f(x,h(x)) 0.00/0.07 f(g(g(x)),x) -> f(g(x),g(x)) 0.00/0.07 ) 0.00/0.07 0.00/0.07 Problem 1: 0.00/0.07 0.00/0.07 Reduction Order Processor: 0.00/0.07 -> Rules: 0.00/0.07 f(f(x,x),g(x)) -> f(x,h(x)) 0.00/0.07 f(g(g(x)),x) -> f(g(x),g(x)) 0.00/0.07 ->Interpretation type: 0.00/0.07 Linear 0.00/0.07 ->Coefficients: 0.00/0.07 Natural Numbers 0.00/0.07 ->Dimension: 0.00/0.07 1 0.00/0.07 ->Bound: 0.00/0.07 2 0.00/0.07 ->Interpretation: 0.00/0.07 0.00/0.07 [f](X1,X2) = X1 + X2 + 2 0.00/0.07 [g](X) = 2.X + 2 0.00/0.07 [h](X) = 2.X + 2 0.00/0.07 0.00/0.07 Problem 1: 0.00/0.07 0.00/0.07 Reduction Order Processor: 0.00/0.07 -> Rules: 0.00/0.07 f(g(g(x)),x) -> f(g(x),g(x)) 0.00/0.07 ->Interpretation type: 0.00/0.07 Linear 0.00/0.07 ->Coefficients: 0.00/0.07 Natural Numbers 0.00/0.07 ->Dimension: 0.00/0.07 1 0.00/0.07 ->Bound: 0.00/0.07 2 0.00/0.07 ->Interpretation: 0.00/0.07 0.00/0.07 [f](X1,X2) = X1 + X2 + 1 0.00/0.07 [g](X) = 2.X + 2 0.00/0.07 [h](X) = 2.X 0.00/0.07 0.00/0.07 Problem 1: 0.00/0.07 0.00/0.07 Dependency Pairs Processor: 0.00/0.07 -> FAxioms: 0.00/0.07 F(f(x1,x2),x3) = F(x1,f(x2,x3)) 0.00/0.07 F(x1,x2) = F(x2,x1) 0.00/0.07 -> Pairs: 0.00/0.07 Empty 0.00/0.07 -> EAxioms: 0.00/0.07 f(f(x1,x2),x3) = f(x1,f(x2,x3)) 0.00/0.07 f(x1,x2) = f(x2,x1) 0.00/0.07 -> Rules: 0.00/0.07 Empty 0.00/0.07 -> SRules: 0.00/0.07 F(f(x1,x2),x3) -> F(x1,x2) 0.00/0.07 F(x1,f(x2,x3)) -> F(x2,x3) 0.00/0.07 0.00/0.07 Problem 1: 0.00/0.07 0.00/0.07 SCC Processor: 0.00/0.07 -> FAxioms: 0.00/0.07 F(f(x1,x2),x3) = F(x1,f(x2,x3)) 0.00/0.07 F(x1,x2) = F(x2,x1) 0.00/0.07 -> Pairs: 0.00/0.07 Empty 0.00/0.07 -> EAxioms: 0.00/0.07 f(f(x1,x2),x3) = f(x1,f(x2,x3)) 0.00/0.07 f(x1,x2) = f(x2,x1) 0.00/0.07 -> Rules: 0.00/0.07 Empty 0.00/0.07 -> SRules: 0.00/0.07 F(f(x1,x2),x3) -> F(x1,x2) 0.00/0.07 F(x1,f(x2,x3)) -> F(x2,x3) 0.00/0.07 ->Strongly Connected Components: 0.00/0.07 There is no strongly connected component 0.00/0.07 0.00/0.07 The problem is finite. 0.00/0.07 EOF
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Equational 2019-03-21 05.09