Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487069203
details
property
value
status
complete
benchmark
cade05t.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
GTSSK07
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.87931 seconds
cpu usage
6.28163
user time
6.03413
system time
0.247508
max virtual memory
1.8412216E7
max residence set size
376276.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) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QReductionProof [EQUIVALENT, 1 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QReductionProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES (21) QDP (22) UsableRulesProof [EQUIVALENT, 0 ms] (23) QDP (24) QReductionProof [EQUIVALENT, 1 ms] (25) QDP (26) QDPQMonotonicMRRProof [EQUIVALENT, 33 ms] (27) QDP (28) NonInfProof [EQUIVALENT, 36 ms] (29) AND (30) QDP (31) DependencyGraphProof [EQUIVALENT, 0 ms] (32) TRUE (33) QDP (34) DependencyGraphProof [EQUIVALENT, 0 ms] (35) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: minus(x, y) -> cond(equal(min(x, y), y), x, y) cond(true, x, y) -> s(minus(x, s(y))) min(0, v) -> 0 min(u, 0) -> 0 min(s(u), s(v)) -> s(min(u, v)) equal(0, 0) -> true equal(s(x), 0) -> false equal(0, s(y)) -> false equal(s(x), s(y)) -> equal(x, y) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: minus(x, y) -> cond(equal(min(x, y), y), x, y) cond(true, x, y) -> s(minus(x, s(y))) min(0, v) -> 0 min(u, 0) -> 0 min(s(u), s(v)) -> s(min(u, v)) equal(0, 0) -> true equal(s(x), 0) -> false equal(0, s(y)) -> false equal(s(x), s(y)) -> equal(x, y) The set Q consists of the following terms: minus(x0, x1) cond(true, x0, x1) min(0, x0) min(x0, 0) min(s(x0), s(x1)) equal(0, 0) equal(s(x0), 0) equal(0, s(x0)) equal(s(x0), s(x1)) ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard