Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487066703
details
property
value
status
complete
benchmark
24.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
Various_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.1992 seconds
cpu usage
4.11454
user time
3.9281
system time
0.186433
max virtual memory
1.8408912E7
max residence set size
245620.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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 113 ms] (2) QTRS (3) Overlay + Local Confluence [EQUIVALENT, 0 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) QDP (11) QReductionProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: max(L(x)) -> x max(N(L(0), L(y))) -> y max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y)))) max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z))))) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: max/1)YES( L/1)YES( N/2(YES,YES) 0/0) s/1(YES) Quasi precedence: N_2 > s_1 0 > s_1 Status: N_2: multiset status 0: multiset status s_1: multiset status With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: max(N(L(0), L(y))) -> y max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y)))) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: max(L(x)) -> x max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z))))) Q is empty. ---------------------------------------- (3) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: max(L(x)) -> x max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z))))) The set Q consists of the following terms: max(L(x0)) max(N(L(x0), N(x1, x2))) ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard