Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conditional pair #516978535
details
property
value
status
complete
benchmark
ohl190.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n119.star.cs.uiowa.edu
space
Mixed_CTRS_2014
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
2.1786429882 seconds
cpu usage
5.528521209
max memory
4.72551424E8
stage attributes
key
value
output-size
3622
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Quasi decreasingness of the given CTRS could be proven: (0) CTRS (1) CTRSToQTRSProof [SOUND, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 37 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 0 ms] (6) QTRS (7) AAECC Innermost [EQUIVALENT, 0 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 0 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Conditional term rewrite system: The TRS R consists of the following rules: b -> c f(b) -> f(a) The conditional TRS C consists of the following conditional rules: a -> c <= b -> c ---------------------------------------- (1) CTRSToQTRSProof (SOUND) The conditional rules have been transormed into unconditional rules according to [CTRS,AAECCNOC]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a -> U1(b) U1(c) -> c b -> c f(b) -> f(a) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(U1(x_1)) = x_1 POL(a) = 1 POL(b) = 1 POL(c) = 0 POL(f(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: b -> c ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a -> U1(b) U1(c) -> c f(b) -> f(a) Q is empty. ---------------------------------------- (5) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(U1(x_1)) = 2*x_1 POL(a) = 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conditional