Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Inner 89993 pair #381733478
details
property
value
status
complete
benchmark
#4.13.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
AG01_innermost
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.65565800667 seconds
cpu usage
3.530555744
max memory
1.88755968E8
stage attributes
key
value
output-size
1765
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) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(0, 1, x) -> f(x, x, x) f(x, y, z) -> 2 0 -> 2 1 -> 2 g(x, x, y) -> y g(x, y, y) -> x The set Q consists of the following terms: f(x0, x1, x2) 0 1 g(x0, x0, x1) g(x0, x1, 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, x) -> F(x, x, x) The TRS R consists of the following rules: f(0, 1, x) -> f(x, x, x) f(x, y, z) -> 2 0 -> 2 1 -> 2 g(x, x, y) -> y g(x, y, y) -> x The set Q consists of the following terms: f(x0, x1, x2) 0 1 g(x0, x0, x1) g(x0, x1, x1) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node. ---------------------------------------- (4) TRUE
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Inner 89993