Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381721554
details
property
value
status
complete
benchmark
size-12-alpha-3-num-412.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.59720110893 seconds
cpu usage
11.128525651
max memory
9.36357888E8
stage attributes
key
value
output-size
4553
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, 0 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 175 ms] (6) QDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 1 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(x1) -> b(x1) b(b(c(x1))) -> c(a(c(a(a(x1))))) c(c(x1)) -> x1 Q is empty. ---------------------------------------- (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: A(x1) -> B(x1) B(b(c(x1))) -> C(a(c(a(a(x1))))) B(b(c(x1))) -> A(c(a(a(x1)))) B(b(c(x1))) -> C(a(a(x1))) B(b(c(x1))) -> A(a(x1)) B(b(c(x1))) -> A(x1) The TRS R consists of the following rules: a(x1) -> b(x1) b(b(c(x1))) -> c(a(c(a(a(x1))))) c(c(x1)) -> x1 Q is empty. 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: B(b(c(x1))) -> A(c(a(a(x1)))) A(x1) -> B(x1) B(b(c(x1))) -> A(a(x1)) B(b(c(x1))) -> A(x1) The TRS R consists of the following rules: a(x1) -> b(x1) b(b(c(x1))) -> c(a(c(a(a(x1))))) c(c(x1)) -> x1 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. B(b(c(x1))) -> A(c(a(a(x1)))) B(b(c(x1))) -> A(a(x1)) The remaining pairs can at least be oriented weakly.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685