Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Context Sensitive pair #516978745
details
property
value
status
complete
benchmark
Ex24_GM04.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n007.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
1.90783596039 seconds
cpu usage
4.923517182
max memory
4.81726464E8
stage attributes
key
value
output-size
2736
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 of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 35 ms] (2) CSR (3) CSDependencyPairsProof [EQUIVALENT, 0 ms] (4) QCSDP (5) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(X, g(X), Y) -> f(Y, Y, Y) g(b) -> c b -> c The replacement map contains the following entries: f: empty set g: {1} b: empty set c: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(X, g(X), Y) -> f(Y, Y, Y) g(b) -> c b -> c The replacement map contains the following entries: f: empty set g: {1} b: empty set c: empty set Used ordering: Polynomial interpretation [POLO]: POL(b) = 1 POL(c) = 0 POL(f(x_1, x_2, x_3)) = 0 POL(g(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: g(b) -> c b -> c ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(X, g(X), Y) -> f(Y, Y, Y) The replacement map contains the following entries: f: empty set g: {1} ---------------------------------------- (3) CSDependencyPairsProof (EQUIVALENT) Using Improved CS-DPs [LPAR08] we result in the following initial Q-CSDP problem. ---------------------------------------- (4) Obligation: Q-restricted context-sensitive dependency pair problem: The symbols in {g_1} are replacing on all positions. The symbols in {f_3, F_3} are not replacing on any position. The ordinary context-sensitive dependency pairs DP_o are: F(X, g(X), Y) -> F(Y, Y, Y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Context Sensitive