Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Relative pair #487521376
details
property
value
status
complete
benchmark
random-186.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
Waldmann_19
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
242.762161016 seconds
cpu usage
965.593227117
max memory
1.5309545472E10
stage attributes
key
value
output-size
3467
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRSRRRProof [EQUIVALENT, 70.3 s] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 3 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 7 ms] (6) RelTRS (7) RIsEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(c(b(x1))) -> a(b(b(x1))) a(c(c(x1))) -> c(a(a(x1))) b(c(a(x1))) -> a(b(a(x1))) The relative TRS consists of the following S rules: b(c(b(x1))) -> b(c(c(x1))) a(b(c(x1))) -> b(b(b(x1))) c(a(c(x1))) -> c(b(a(x1))) a(a(a(x1))) -> a(c(c(x1))) ---------------------------------------- (1) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^3, +, *, >=, >) : <<< POL(b(x_1)) = [[1], [1], [1]] + [[1, 1, 0], [1, 0, 1], [1, 0, 1]] * x_1 >>> <<< POL(c(x_1)) = [[1], [2], [0]] + [[2, 0, 0], [0, 1, 1], [0, 1, 1]] * x_1 >>> <<< POL(a(x_1)) = [[1], [0], [0]] + [[2, 0, 0], [2, 0, 0], [2, 0, 0]] * x_1 >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: b(c(b(x1))) -> a(b(b(x1))) b(c(a(x1))) -> a(b(a(x1))) Rules from S: a(b(c(x1))) -> b(b(b(x1))) c(a(c(x1))) -> c(b(a(x1))) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(c(c(x1))) -> c(a(a(x1))) The relative TRS consists of the following S rules: b(c(b(x1))) -> b(c(c(x1))) a(a(a(x1))) -> a(c(c(x1))) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(a(x_1)) = x_1 POL(b(x_1)) = 1 + x_1 POL(c(x_1)) = x_1 With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Relative