Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733315
details
property
value
status
complete
benchmark
Ex1_GM99.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.39620804787 seconds
cpu usage
3.171729757
max memory
2.0160512E8
stage attributes
key
value
output-size
4050
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 of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 56 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 0 ms] (4) CSR (5) CSRInnermostProof [EQUIVALENT, 0 ms] (6) CSR (7) CSDependencyPairsProof [EQUIVALENT, 0 ms] (8) QCSDP (9) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (10) TRUE ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(a, b, X) -> f(X, X, X) c -> a c -> b The replacement map contains the following entries: f: {3} a: empty set 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(a, b, X) -> f(X, X, X) c -> a c -> b The replacement map contains the following entries: f: {3} a: empty set b: empty set c: empty set Used ordering: Polynomial interpretation [POLO]: POL(a) = 1 POL(b) = 0 POL(c) = 1 POL(f(x_1, x_2, x_3)) = x_3 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: c -> b ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(a, b, X) -> f(X, X, X) c -> a The replacement map contains the following entries: f: {3} a: empty set b: empty set c: empty set ---------------------------------------- (3) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(a, b, X) -> f(X, X, X) c -> a
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651