Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381717185
details
property
value
status
complete
benchmark
sym-4.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n192.star.cs.uiowa.edu
space
Waldmann_06_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.14825415611 seconds
cpu usage
5.629808544
max memory
7.2624128E8
stage attributes
key
value
output-size
5104
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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 1 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 3 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 3 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 0 ms] (10) QTRS (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(x1)) -> c(c(c(c(x1)))) c(x1) -> x1 b(c(b(x1))) -> b(b(b(x1))) Q is empty. ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(c(b(x1))) -> b(b(b(x1))) b(b(b(x1))) -> b(c(c(c(c(x1))))) c(b(b(x1))) -> c(c(c(c(c(x1))))) b(c(x1)) -> b(x1) c(c(x1)) -> c(x1) Q is empty. ---------------------------------------- (3) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b_{c_1}(c_{b_1}(b_{b_1}(x1))) -> b_{b_1}(b_{b_1}(b_{b_1}(x1))) b_{c_1}(c_{b_1}(b_{c_1}(x1))) -> b_{b_1}(b_{b_1}(b_{c_1}(x1))) b_{b_1}(b_{b_1}(b_{b_1}(x1))) -> b_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{b_1}(x1))))) b_{b_1}(b_{b_1}(b_{c_1}(x1))) -> b_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(x1))))) c_{b_1}(b_{b_1}(b_{b_1}(x1))) -> c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{b_1}(x1))))) c_{b_1}(b_{b_1}(b_{c_1}(x1))) -> c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(x1))))) b_{c_1}(c_{b_1}(x1)) -> b_{b_1}(x1) b_{c_1}(c_{c_1}(x1)) -> b_{c_1}(x1) c_{c_1}(c_{b_1}(x1)) -> c_{b_1}(x1) c_{c_1}(c_{c_1}(x1)) -> c_{c_1}(x1) Q is empty. ---------------------------------------- (5) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(b_{b_1}(x_1)) = 1 + x_1 POL(b_{c_1}(x_1)) = x_1 POL(c_{b_1}(x_1)) = 2 + x_1 POL(c_{c_1}(x_1)) = x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685