Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conditional pair #487562888
details
property
value
status
complete
benchmark
369.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
COPS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.71047091484 seconds
cpu usage
3.808186788
max memory
2.47894016E8
stage attributes
key
value
output-size
4517
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, 59 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 0 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 10 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 0 ms] (10) QTRS (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Conditional term rewrite system: The TRS R consists of the following rules: a -> c a -> d b -> c b -> d s(c) -> t(k) s(c) -> t(l) g(x, x) -> h(x, x) The conditional TRS C consists of the following conditional rules: f(x) -> pair(x, y) <= s(x) -> t(y) ---------------------------------------- (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: f(x) -> U1(s(x), x) U1(t(y), x) -> pair(x, y) a -> c a -> d b -> c b -> d s(c) -> t(k) s(c) -> t(l) g(x, x) -> h(x, x) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(U1(x_1, x_2)) = 2 + x_1 + x_2 POL(a) = 1 POL(b) = 1 POL(c) = 0 POL(d) = 0 POL(f(x_1)) = 2 + 2*x_1 POL(g(x_1, x_2)) = 1 + x_1 + x_2 POL(h(x_1, x_2)) = 1 + x_1 + x_2 POL(k) = 0 POL(l) = 0 POL(pair(x_1, x_2)) = 2 + x_1 + 2*x_2 POL(s(x_1)) = x_1 POL(t(x_1)) = 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a -> c a -> d b -> c b -> d
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conditional