Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516963985
details
property
value
status
complete
benchmark
22.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n031.star.cs.uiowa.edu
space
Various_04
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
2.09166908264 seconds
cpu usage
5.344453017
max memory
4.69069824E8
stage attributes
key
value
output-size
4206
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished 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, 16 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) QDP (9) QReductionProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x, 0) -> s(0) f(s(x), s(y)) -> s(f(x, y)) g(0, x) -> g(f(x, x), x) Q is empty. ---------------------------------------- (1) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is f(x, 0) -> s(0) f(s(x), s(y)) -> s(f(x, y)) The TRS R 2 is g(0, x) -> g(f(x, x), x) The signature Sigma is {g_2} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x, 0) -> s(0) f(s(x), s(y)) -> s(f(x, y)) g(0, x) -> g(f(x, x), x) The set Q consists of the following terms: f(x0, 0) f(s(x0), s(x1)) g(0, x0) ---------------------------------------- (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(s(x), s(y)) -> F(x, y) G(0, x) -> G(f(x, x), x) G(0, x) -> F(x, x) The TRS R consists of the following rules: f(x, 0) -> s(0) f(s(x), s(y)) -> s(f(x, y)) g(0, x) -> g(f(x, x), x) The set Q consists of the following terms: f(x0, 0) f(s(x0), s(x1)) g(0, x0) We have to consider all minimal (P,Q,R)-chains. ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard