Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487067423
details
property
value
status
complete
benchmark
#3.12.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n185.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.77659 seconds
cpu usage
3.99706
user time
3.80416
system time
0.192906
max virtual memory
1.8343376E7
max residence set size
258712.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox/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, 55 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 8 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 0 ms] (8) QTRS (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(nil, y) -> y app(add(n, x), y) -> add(n, app(x, y)) reverse(nil) -> nil reverse(add(n, x)) -> app(reverse(x), add(n, nil)) shuffle(nil) -> nil shuffle(add(n, x)) -> add(n, shuffle(reverse(x))) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(add(x_1, x_2)) = 2 + 2*x_1 + x_2 POL(app(x_1, x_2)) = x_1 + x_2 POL(nil) = 0 POL(reverse(x_1)) = x_1 POL(shuffle(x_1)) = 2 + 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: shuffle(nil) -> nil shuffle(add(n, x)) -> add(n, shuffle(reverse(x))) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(nil, y) -> y app(add(n, x), y) -> add(n, app(x, y)) reverse(nil) -> nil reverse(add(n, x)) -> app(reverse(x), add(n, nil)) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(add(x_1, x_2)) = 2*x_1 + x_2 POL(app(x_1, x_2)) = x_1 + x_2 POL(nil) = 0 POL(reverse(x_1)) = 2 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: reverse(nil) -> nil ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(nil, y) -> y app(add(n, x), y) -> add(n, app(x, y)) reverse(add(n, x)) -> app(reverse(x), add(n, nil)) Q is empty. ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard