Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516966685
details
property
value
status
complete
benchmark
4.50.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
2.10284304619 seconds
cpu usage
5.388948688
max memory
4.72993792E8
stage attributes
key
value
output-size
1962
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(0, 1, x) -> 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 none The TRS R 2 is f(0, 1, x) -> f(x, x, x) The signature Sigma is {f_3} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(0, 1, x) -> f(x, x, x) The set Q consists of the following terms: f(0, 1, 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(0, 1, x) -> F(x, x, x) The TRS R consists of the following rules: f(0, 1, x) -> f(x, x, x) The set Q consists of the following terms: f(0, 1, x0) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node. ---------------------------------------- (6) TRUE
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard