Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conditional pair #487562994
details
property
value
status
complete
benchmark
minus1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n092.star.cs.uiowa.edu
space
Mixed_CTRS_2014
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.72334289551 seconds
cpu usage
3.460207078
max memory
2.28237312E8
stage attributes
key
value
output-size
2001
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Quasi decreasingness of the given CTRS could be proven: (0) CTRS (1) CTRSToQTRSProof [SOUND, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 29 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Conditional term rewrite system: The TRS R consists of the following rules: minus(x, 0) -> x The conditional TRS C consists of the following conditional rules: minus(x, s(y)) -> z <= minus(x, y) -> s(z) ---------------------------------------- (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: minus(x, s(y)) -> U1(minus(x, y)) U1(s(z)) -> z minus(x, 0) -> x Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Knuth-Bendix order [KBO] with precedence:minus_2 > U1_1 > s_1 > 0 and weight map: 0=1 s_1=2 U1_1=1 minus_2=0 The variable weight is 1With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: minus(x, s(y)) -> U1(minus(x, y)) U1(s(z)) -> z minus(x, 0) -> x ---------------------------------------- (4) Obligation: Q restricted rewrite system: R is empty. Q is empty. ---------------------------------------- (5) RisEmptyProof (EQUIVALENT) The TRS R is empty. Hence, termination is trivially proven. ---------------------------------------- (6) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conditional