Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Equational pair #487092752
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
n149.star.cs.uiowa.edu
space
AProVE_AC_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.73989 seconds
cpu usage
13.2257
user time
12.6979
system time
0.527753
max virtual memory
1.8279592E7
max residence set size
1394948.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given ETRS could be proven: (0) ETRS (1) RRRPoloETRSProof [EQUIVALENT, 1634 ms] (2) ETRS (3) RRRPoloETRSProof [EQUIVALENT, 773 ms] (4) ETRS (5) RRRPoloETRSProof [EQUIVALENT, 636 ms] (6) ETRS (7) EquationalDependencyPairsProof [EQUIVALENT, 0 ms] (8) EDP (9) EDependencyGraphProof [EQUIVALENT, 0 ms] (10) EDP (11) EUsableRulesReductionPairsProof [EQUIVALENT, 2 ms] (12) EDP (13) PisEmptyProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Equational rewrite system: The TRS R consists of the following rules: union(empty, X) -> X max(singl(x)) -> x max(union(singl(x), singl(0))) -> x 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))))) The set E consists of the following equations: union(x, y) == union(y, x) union(union(x, y), z) == union(x, union(y, z)) ---------------------------------------- (1) RRRPoloETRSProof (EQUIVALENT) The following E TRS is given: Equational rewrite system: The TRS R consists of the following rules: union(empty, X) -> X max(singl(x)) -> x max(union(singl(x), singl(0))) -> x 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))))) The set E consists of the following equations: union(x, y) == union(y, x) union(union(x, y), z) == union(x, union(y, z)) The following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly by a polynomial ordering: union(empty, X) -> X Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(empty) = 1 POL(max(x_1)) = x_1 POL(s(x_1)) = x_1 POL(singl(x_1)) = x_1 POL(union(x_1, x_2)) = x_1 + x_2 ---------------------------------------- (2) Obligation: Equational rewrite system: The TRS R consists of the following rules: max(singl(x)) -> x max(union(singl(x), singl(0))) -> x 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))))) The set E consists of the following equations: union(x, y) == union(y, x) union(union(x, y), z) == union(x, union(y, z)) ---------------------------------------- (3) RRRPoloETRSProof (EQUIVALENT) The following E TRS is given: Equational rewrite system: The TRS R consists of the following rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Equational