Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487066698
details
property
value
status
complete
benchmark
15.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
Various_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.44534 seconds
cpu usage
6.12629
user time
5.80331
system time
0.322976
max virtual memory
1.9610368E7
max residence set size
623276.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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 6 ms] (4) QTRS (5) Overlay + Local Confluence [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 22 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) MRRProof [EQUIVALENT, 25 ms] (12) QDP (13) PisEmptyProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(s(x)) -> s(s(f(p(s(x))))) f(0) -> 0 p(s(x)) -> x Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: s(f(x)) -> s(p(f(s(s(x))))) 0'(f(x)) -> 0'(x) s(p(x)) -> x Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0'(x_1)) = x_1 POL(f(x_1)) = 1 + x_1 POL(p(x_1)) = x_1 POL(s(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 0'(f(x)) -> 0'(x) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: s(f(x)) -> s(p(f(s(s(x))))) s(p(x)) -> x Q is empty. ---------------------------------------- (5) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (6) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: s(f(x)) -> s(p(f(s(s(x))))) s(p(x)) -> x The set Q consists of the following terms: s(f(x0))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard