Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Relat 75837 pair #381724937
details
property
value
status
complete
benchmark
#3.56_rand.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n190.star.cs.uiowa.edu
space
INVY_15
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.79153203964 seconds
cpu usage
8.257586221
max memory
8.5538816E8
stage attributes
key
value
output-size
5834
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 RelTRS could be proven: (0) RelTRS (1) RelTRSRRRProof [EQUIVALENT, 59 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 7 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 15 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 7 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 3 ms] (10) RelTRS (11) RIsEmptyProof [EQUIVALENT, 1 ms] (12) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: g(c(x, s(y))) -> g(c(s(x), y)) f(c(s(x), y)) -> f(c(x, s(y))) f(f(x)) -> f(d(f(x))) f(x) -> x The relative TRS consists of the following S rules: rand(x) -> x rand(x) -> rand(s(x)) ---------------------------------------- (1) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(c(x_1, x_2)) = x_1 + x_2 POL(d(x_1)) = x_1 POL(f(x_1)) = 1 + x_1 POL(g(x_1)) = x_1 POL(rand(x_1)) = x_1 POL(s(x_1)) = x_1 With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: f(x) -> x Rules from S: none ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: g(c(x, s(y))) -> g(c(s(x), y)) f(c(s(x), y)) -> f(c(x, s(y))) f(f(x)) -> f(d(f(x))) The relative TRS consists of the following S rules: rand(x) -> x rand(x) -> rand(s(x)) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(c(x_1, x_2)) = x_1 + x_2 POL(d(x_1)) = x_1 POL(f(x_1)) = x_1 POL(g(x_1)) = x_1 POL(rand(x_1)) = 1 + x_1 POL(s(x_1)) = x_1 With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: none
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Relat 75837