Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487069148
details
property
value
status
complete
benchmark
cade11.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n187.star.cs.uiowa.edu
space
GTSSK07
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.45645 seconds
cpu usage
5.2391
user time
5.00671
system time
0.232392
max virtual memory
1.841096E7
max residence set size
315596.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) AAECC Innermost [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 3 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QReductionProof [EQUIVALENT, 0 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) NonInfProof [EQUIVALENT, 49 ms] (20) QDP (21) PisEmptyProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(true, x, y) -> f(gt(x, y), s(x), s(s(y))) gt(0, v) -> false gt(s(u), 0) -> true gt(s(u), s(v)) -> gt(u, v) Q is empty. ---------------------------------------- (1) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is gt(0, v) -> false gt(s(u), 0) -> true gt(s(u), s(v)) -> gt(u, v) The TRS R 2 is f(true, x, y) -> f(gt(x, y), s(x), s(s(y))) The signature Sigma is {f_3} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(true, x, y) -> f(gt(x, y), s(x), s(s(y))) gt(0, v) -> false gt(s(u), 0) -> true gt(s(u), s(v)) -> gt(u, v) The set Q consists of the following terms: f(true, x0, x1) gt(0, x0) gt(s(x0), 0) gt(s(x0), s(x1)) ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: F(true, x, y) -> F(gt(x, y), s(x), s(s(y))) F(true, x, y) -> GT(x, y) GT(s(u), s(v)) -> GT(u, v) The TRS R consists of the following rules: f(true, x, y) -> f(gt(x, y), s(x), s(s(y))) gt(0, v) -> false gt(s(u), 0) -> true gt(s(u), s(v)) -> gt(u, v)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard