Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381718296
details
property
value
status
complete
benchmark
dup13.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
Trafo_06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
52.7570569515 seconds
cpu usage
207.250964314
max memory
8.472457216E9
stage attributes
key
value
output-size
22597
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) RootLabelingProof [EQUIVALENT, 1 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 21 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 103 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 1543 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 2848 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(a(x1)))) -> a(a(b(b(b(b(b(b(x1)))))))) b(b(a(a(x1)))) -> b(b(b(b(c(c(x1)))))) a(a(b(b(b(b(c(c(x1)))))))) -> a(a(a(a(a(a(b(b(x1)))))))) Q is empty. ---------------------------------------- (1) 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. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))))))) a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))))))) a_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{c_1}(x1)))))))) b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(x1)))) -> b_{b_1}(b_{b_1}(b_{b_1}(b_{c_1}(c_{c_1}(c_{a_1}(x1)))))) b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(x1)))) -> b_{b_1}(b_{b_1}(b_{b_1}(b_{c_1}(c_{c_1}(c_{b_1}(x1)))))) b_{b_1}(b_{a_1}(a_{a_1}(a_{c_1}(x1)))) -> b_{b_1}(b_{b_1}(b_{b_1}(b_{c_1}(c_{c_1}(c_{c_1}(x1)))))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{c_1}(c_{c_1}(c_{a_1}(x1)))))))) -> a_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))))))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{c_1}(c_{c_1}(c_{b_1}(x1)))))))) -> a_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))))))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{c_1}(c_{c_1}(c_{c_1}(x1)))))))) -> a_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{c_1}(x1)))))))) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a_{a_1}(x_1)) = x_1 POL(a_{b_1}(x_1)) = x_1 POL(a_{c_1}(x_1)) = 1 + x_1 POL(b_{a_1}(x_1)) = x_1 POL(b_{b_1}(x_1)) = x_1 POL(b_{c_1}(x_1)) = x_1 POL(c_{a_1}(x_1)) = x_1 POL(c_{b_1}(x_1)) = x_1 POL(c_{c_1}(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a_{a_1}(a_{a_1}(a_{a_1}(a_{c_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{c_1}(x1)))))))) b_{b_1}(b_{a_1}(a_{a_1}(a_{c_1}(x1)))) -> b_{b_1}(b_{b_1}(b_{b_1}(b_{c_1}(c_{c_1}(c_{c_1}(x1)))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685