Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conditional pair #487562986
details
property
value
status
complete
benchmark
ex3-muterm14.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n094.star.cs.uiowa.edu
space
Mixed_CTRS_2014
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
11.8630950451 seconds
cpu usage
23.949197079
max memory
4.655665152E9
stage attributes
key
value
output-size
7101
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Quasi decreasingness of the given CTRS could not be shown: (0) CTRS (1) CTRSToQTRSProof [SOUND, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 48 ms] (4) QTRS (5) AAECC Innermost [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) AND (11) QDP (12) UsableRulesProof [EQUIVALENT, 0 ms] (13) QDP (14) QReductionProof [EQUIVALENT, 0 ms] (15) QDP (16) NonTerminationLoopProof [COMPLETE, 0 ms] (17) NO (18) QDP (19) MNOCProof [EQUIVALENT, 0 ms] (20) QDP (21) NonLoopProof [COMPLETE, 0 ms] (22) NO ---------------------------------------- (0) Obligation: Conditional term rewrite system: The TRS R consists of the following rules: f(x) -> g(a) g(x) -> f(x) The conditional TRS C consists of the following conditional rules: a -> b <= 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(a) U1(c) -> U2(b) U2(c) -> b f(x) -> g(a) g(x) -> f(x) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(U1(x_1)) = x_1 POL(U2(x_1)) = 2*x_1 POL(a) = 0 POL(b) = 0 POL(c) = 2 POL(f(x_1)) = 2*x_1 POL(g(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: U1(c) -> U2(b) U2(c) -> b ---------------------------------------- (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 TRS Conditional