Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Relat 75837 pair #381725033
details
property
value
status
complete
benchmark
#3.7_rand.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n094.star.cs.uiowa.edu
space
INVY_15
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
8.65420293808 seconds
cpu usage
29.190558138
max memory
4.080508928E9
stage attributes
key
value
output-size
6469
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) RelTRS Reverse [SOUND, 0 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 29 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 5 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 30 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 16 ms] (10) RelTRS (11) RelTRSRRRProof [EQUIVALENT, 0 ms] (12) RelTRS (13) RIsEmptyProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: half(0) -> 0 half(s(s(x))) -> s(half(x)) log(s(0)) -> 0 log(s(s(x))) -> s(log(s(half(x)))) The relative TRS consists of the following S rules: rand(x) -> x rand(x) -> rand(s(x)) ---------------------------------------- (1) RelTRS Reverse (SOUND) We have reversed the following relative TRS [REVERSE]: The set of rules R is half(0) -> 0 half(s(s(x))) -> s(half(x)) log(s(0)) -> 0 log(s(s(x))) -> s(log(s(half(x)))) The set of rules S is rand(x) -> x rand(x) -> rand(s(x)) We have obtained the following relative TRS: The set of rules R is 0'(half(x)) -> 0'(x) s(s(half(x))) -> half(s(x)) 0'(s(log(x))) -> 0'(x) s(s(log(x))) -> half(s(log(s(x)))) The set of rules S is rand(x) -> x rand(x) -> s(rand(x)) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: 0'(half(x)) -> 0'(x) s(s(half(x))) -> half(s(x)) 0'(s(log(x))) -> 0'(x) s(s(log(x))) -> half(s(log(s(x)))) The relative TRS consists of the following S rules: rand(x) -> x rand(x) -> s(rand(x)) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(0'(x_1)) = x_1 POL(half(x_1)) = x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Relat 75837