Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Inner 89993 pair #381733573
details
property
value
status
complete
benchmark
#4.15.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n022.star.cs.uiowa.edu
space
AG01_innermost
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.98189401627 seconds
cpu usage
3.488697499
max memory
2.2708224E8
stage attributes
key
value
output-size
3866
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 17 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) UsableRulesProof [EQUIVALENT, 0 ms] (6) QDP (7) QReductionProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(0, 1, g(x, y), z) -> f(g(x, y), g(x, y), g(x, y), h(x)) g(0, 1) -> 0 g(0, 1) -> 1 h(g(x, y)) -> h(x) The set Q consists of the following terms: f(0, 1, g(x0, x1), x2) g(0, 1) h(g(x0, x1)) ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: F(0, 1, g(x, y), z) -> F(g(x, y), g(x, y), g(x, y), h(x)) F(0, 1, g(x, y), z) -> H(x) H(g(x, y)) -> H(x) The TRS R consists of the following rules: f(0, 1, g(x, y), z) -> f(g(x, y), g(x, y), g(x, y), h(x)) g(0, 1) -> 0 g(0, 1) -> 1 h(g(x, y)) -> h(x) The set Q consists of the following terms: f(0, 1, g(x0, x1), x2) g(0, 1) h(g(x0, x1)) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: H(g(x, y)) -> H(x) The TRS R consists of the following rules: f(0, 1, g(x, y), z) -> f(g(x, y), g(x, y), g(x, y), h(x)) g(0, 1) -> 0 g(0, 1) -> 1 h(g(x, y)) -> h(x) The set Q consists of the following terms: f(0, 1, g(x0, x1), x2) g(0, 1) h(g(x0, x1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Inner 89993